Advanced SearchSearch Tips
Polar-Natural Distance and Curve Reconstruction
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Polar-Natural Distance and Curve Reconstruction
Kim, Hyoung-Seok; Kim, Ho-Sook;
  PDF(new window)
We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.
Point Ordering;Curve Reconstruction;Polar-Natural Distance;
 Cited by
H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, "Surface Reconstruction from unorganized points," Proc. SIGGRAPH' 92, 1992, pp. 71-78.

J. D. Boissonnat and B. Geiger, "Three cimentional reconstruction of complex shapes based on the Delaunay triangulation," Proc. of Biomedical Image Process, Biomed. Visualizaiton, 1993, pp. 964-975.

Philsu Kim and Hyoung-Seok Kim, “Point ordering with the natural distance based on Brownian motion,” Mathematical problems in engineering, vol. 2010, article ID 450460, 2010, p. 17.

J. D. Boissonnat and F. Cazals, “Smooth surface reconstruction via natural neighbor interpolation of distance functions,” Comp. Geom. Theo. Appl., vol. 22, 2002, pp. 185-203. crossref(new window)

H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel, “On the shape of a set of points in the plane,” IEEE Trans. Information Theory, 1983, pp. 551-559. crossref(new window)

D. Attali, "r-regular shape reconstruction from unorganized points," Proc. of 13th Ann. Sympos. Comput. Geom., 1997, pp. 248-253.

N. Amenta, M. Bern, and D. Eppstein, “The crust and the beta-skeleton: combinatorial curve reconstruction,” Graphical Models, vol. 60, 1998, pp. 125-135. crossref(new window)

T. K. Dey and T. K. Kumar, "A simple provable algorithm for curve reconstruction," Proc. 10th. ACM-SIAM Symp. Discr. Algorithms, 1999, pp. 893-894.

L. Fang and D. C. Gossard, "Fitting 3D curves to unorganized data points using deformable curves," Proc. of CG International'92, 1992, pp. 535-543.

J. P. Dedieu and C. H. Favardin, “Algorithms for ordering unorganized points along parametrized curves,” Numerical Algorithms, vol. 6, 1994, pp. 160-200. crossref(new window)

G. Taubin and R. Ronfard, “Implicit simplical models for adaptive curve reconstruction,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 18, 1996, pp. 321-325. crossref(new window)

Thanh An Nguyen and Yong Zeng, “VICUR: A human-vision-based algorithm for curve reconstruction,” Robotics and Computer Integrated manufacturing, vol. 24, 2008, pp. 824-834. crossref(new window)