Curve Reconstruction: Given a set of samples from a curve we
wish to compute a polygonal reconstruction of the curve, i.e.,
points should be joined by edges in the order they appear on the
curve. Reconstruction of smooth curves: NN-crust We provide a
very simple nearest neighbor algorithm for reconstructing smooth
curves. The algorithm works in any dimension for curve
reconstruction. We show a reconstructed curve in 3D below. T. K.
Dey and P. simple provable algorithm for curve reconstruction .
Proc. 10th. ACM-SIAM Symposium on Discrete Algorithms (SODA '99)
1999, A reconstructed curve in 3D Also check PROGRAM implemented
at MPI, Germany. Reconstruction of curves with or without
boundary: Conservative-crust Smooth curves with boundary points
need special attention since the usual methods such as crust and
NN-crust cannot handle such curves. We devise an algorithm for
reconstructing curves with boundary points. T. K. Dey, K.
Mehlhorn and E. Ramos. Curve reconstruction: connecting dots
with good reason . Comput