Algorithms for ordering unorganized points along parametrized curves (Q1316076)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for ordering unorganized points along parametrized curves |
scientific article |
Statements
Algorithms for ordering unorganized points along parametrized curves (English)
0 references
13 June 1994
0 references
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.
0 references
curve reconstruction
0 references
data point ordering
0 references
computational geometry
0 references
robotics applications
0 references
computational complexity
0 references
algebraic curve plotting
0 references