论文信息 - Algorithms for ordering unorganized points along parametrized curves

Algorithms for ordering unorganized points along parametrized curves

Letn points be given on several arcs of curve. The equations of these curves are unknown. We give two algorithms, based on geometrical criteria, that allow to determine an order on these points: the order given by the curvilinear abscissa. The computational complexity of these algorithms is inO(n logn) and the space complexity inO(n).

Jean-Pierre Dedieu | Chantal Favardin

[1] J. O'Rourke,et al. Connect-the-dots: a new heuristic , 1987 .

[2] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[3] Jean-Daniel Boissonnat,et al. Geometric structures for three-dimensional shape representation , 1984, TOGS.

[4] Wolfgang Böhm,et al. A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[5] Forest Baskett,et al. An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[6] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[7] Mariette Yvinec,et al. Non Convex Contour Reconstruction , 1990, J. Symb. Comput..

[8] H. Piaggio. Differential Geometry of Curves and Surfaces , 1952, Nature.

[9] John K. Johnstone,et al. Sorting Points Along an Algebraic Curve , 1990, SIAM J. Comput..

[10] Warren N. Waggenspack,et al. Piecewise parametric approximations for algebraic curves , 1989, Comput. Aided Geom. Des..

[11] Robert E. Barnhill,et al. Surfaces in computer aided geometric design: a survey with new results , 1985, Comput. Aided Geom. Des..

[12] Chandrajit L. Bajaj,et al. Tracing surface intersections , 1988, Comput. Aided Geom. Des..