Abstract
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).
Similar content being viewed by others
References
P. Alevizos, J.D. Boissonnat and M. Yvinec, Non-convex contour reconstruction, J. Symbolic Comp. 10 (1990) 225–252.
C.L. Bajaj, C.M. Hoffmann, R.E. Lynch and J.E.M. Hopcroft, Tracing surface intersections, Comp. Aided Geom. Design 5 (1988) 285–307.
R.E. Barnhill, Surfaces in computer aided geometric design: A survey with new results, Comp. Aided Geom. Design 2 (1985) 1–17.
W. Böhm, G. Farin and J. Kahmann, A survey of curve and surface methods in CAGD, Comp. Aided Geom. Design 1 (1984) 1–60.
J.D. Boissonnat, Geometric structures for three-dimensional shape representation, ACM Trans. Graph. 3 (1984) 266–286.
M.P. Do Carmo,Differential Geometry of Curves and Surfaces (Prentice-Hall, Englewood Cliffs, NJ, 1976).
R.O. Duda and P.E. Hart,Pattern Classification and Scene Analysis (Wiley-Interscience, New York, 1973).
H. Edelsbrunner,Algorithms in Combinatorial Geometry (Springer, 1987).
Ch. Favardin, Détermination automatique de structures géométriques destinées à la reconstruction de courbes et de surfaces à partir de données ponctuelles, Thèse de Doctorat, Université Paul Sabatier de Toulouse III (1993).
J.H. Friedman, F. Baskett and L.J. Shustek, An algorithm for finding nearest neighbours, IEEE Trans. Comp. (1975) 1000–1006.
J.H. Friedman, J.L. Bentley and R.A. Finkel, An algorithm for finding best matches in logarithmic expected time, ACM Trans. Math. Software 3 (1977) 209–226.
J.K. Johnstone and C.L. Bajaj, Sorting points along an algebraic curve, SIAM J. Comp. 19 (1990) 925–967.
P. Krings, Fonctionnalité d'usinage sur le logiciel de CFAO Aérolis, Rapport de stage de fin d'études, AEROSPATIALE, Bureau détude de Toulouse-St. Martin, Département série service développement CAO (1991).
P.J. Laurent, A. Le Méhauté and L.L. Schumaker,Proc. Int. Conf. on Curves and Surfaces, Chamonix (Academic Press, New York, 1991) pp. 135–138.
J. O'Rourke, H. Booth and R. Washington, Connected-the-dots: A new heuristic, Comp. Vision, Graph. Image Proc. 39 (1987) 258–266.
F.P. Preparata and M.I. Shamos,Computational Geometry; an Introduction (Springer, 1990).
J.J. Stoker,Pure and Applied Mathematics, Vol. 20,Differential Geometry (Wiley-Interscience, 1969).
W.N. Waggenspack, Jr. and C.C. Anderson, Piecewise parametric approximations for algebraic curves, Comp. Aided Geom. Design 6 (1989) 33–53.
Author information
Authors and Affiliations
Additional information
Communicated by P.J. Laurent
Rights and permissions
About this article
Cite this article
Dedieu, J.P., Favardin, C. Algorithms for ordering unorganized points along parametrized curves. Numer Algor 6, 169–200 (1994). https://doi.org/10.1007/BF02149768
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02149768