A new non-Delaunay-based approach is presented to reconstruct a curve, lying in 2- or 3-space, from a sampling of points. The underlying theory is based on bounding curvature to determine monotone pieces of the curve. Theoretical guarantees are established. The implemented algorithm, based heuristically on the theory, proceeds by iteratively partitioning the sample points using an octree data structure. The strengths of the approach are (a) simple implementation, (b) efficiency - experimental performance compares favorably with Delaunay-based algorithms, (c) robustness - curves with multiple components and sharp corners are reconstructed satisfactorily, and (d) potential extension to surface reconstruction. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Guha, S., Josiah, P., Mittal, A., & Tran, S. D. (2002). Non-delaunay-based curve reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 79–90). https://doi.org/10.1007/3-540-36136-7_8
Mendeley helps you to discover research relevant for your work.