
This paper describes a method for the construction of rational polynomial paths that does not require the apriori specification of either vertices or weights. An algebra of rational paths is developed within which paths with positive weights can be generated from more elementary paths with the same property. Case studies demonstrate that the path algebra can provide a simple means of obtaining exact rational representations of paths defined in non‐rational terms.
path algebra, Numerical approximation and computational geometry (primarily algorithms), Computer science aspects of computer-aided design
path algebra, Numerical approximation and computational geometry (primarily algorithms), Computer science aspects of computer-aided design
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
