Algorithms for ordering unorganized points along parametrized curves

DOI10.1007/BF02149768zbMath0789.65007MaRDI QIDQ1316076

Ch. Favardin, Jean-Pierre Dedieu

Publication date: 13 June 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

computational complexitycomputational geometrycurve reconstructionalgebraic curve plottingdata point orderingrobotics applications

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (2)

Point ordering with natural distance based on Brownian motion ⋮ Curve reconstruction from noisy samples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surfaces in computer aided geometric design: A survey with new results
• A survey of curve and surface methods in CAGD
• Tracing surface intersections
• Piecewise parametric approximations for algebraic curves
• Non-convex contour reconstruction
• Sorting Points Along an Algebraic Curve
• Connect-the-dots: A new heuristic
• An Algorithm for Finding Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

This page was built for publication: Algorithms for ordering unorganized points along parametrized curves