Algorithms for ordering unorganized points along parametrized curves
The aim of this study is to find an automatic method to order unorganized points which are uniformly distributed along curves. The authors present two practical algorithms based on geometrical criteria. The computational complexity of these algorithms is \(O(n\log n)\) and the space complexity \(O(n)\). Four consistent practical applications are discussed: feasibility of a piece machining, space object motion, algebraic curve plotting and sorting a restricted number of points non-uniformly distributed along an algebraic curve.
scientific article; zbMATH DE number 519510
scientific article