Point Ordering with Natural Distance Based on Brownian Motion

We consider a curve reconstruction problem from unorganized point clouds with noise. In general, the result of curve reconstruction depends on how to select and order the representative points to resemble the shape of the clouds. We exploit a natural distance based on a property of one-dimensional Brownian motion to order sample points, which simultaneously reflect smoothness and nearness of points, so that our algorithm is able to reconstruct not only simple curves but also nonsimple curves. Numerous examples show that this algorithm is effective. The natural distance proposed in this paper is able to play an important role in a variety of fields of measuring the distance of points with considering direction.

[1]  Dominique Attali,et al.  r-regular shape reconstruction from unorganized points , 1997, SCG '97.

[2]  Gabriel Taubin,et al.  Implicit Simplicial Models for Adaptive Curve Reconstruction , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  David C. Gossard,et al.  Fitting 3D curves to unorganized data points using deformable curves , 1992 .

[4]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[5]  Yong Zeng,et al.  A distance-based parameter free algorithm for curve reconstruction , 2008, Comput. Aided Des..

[6]  Jean-Pierre Dedieu,et al.  Algorithms for ordering unorganized points along parametrized curves , 2005, Numerical Algorithms.

[7]  L. Figueiredo,et al.  Computational morphology of curves , 1994, The Visual Computer.

[8]  Tamal K. Dey,et al.  Fast Reconstruction of Curves with Sharp Corners , 2002, Int. J. Comput. Geom. Appl..

[9]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2002, Comput. Geom..

[10]  Tamal K. Dey,et al.  A simple provable algorithm for curve reconstruction , 1999, SODA '99.

[11]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[12]  Jean-Daniel Boissonnat,et al.  Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation , 1993, Electronic Imaging.

[13]  Kurt Mehlhorn,et al.  Curve reconstruction: connecting dots with good reason , 1999, SCG '99.

[14]  Tamal K. Dey,et al.  Reconstructing curves with sharp corners , 2001, Comput. Geom..

[15]  Stefan Funke,et al.  Curve reconstruction from noisy samples , 2003, SCG '03.

[16]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[17]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[18]  Thanh An Nguyen,et al.  VICUR: A human-vision-based algorithm for curve reconstruction , 2008 .

[19]  Kurt Mehlhorn,et al.  TSP-based curve reconstruction in polynomial time , 2000, SODA '00.