Greedy Beta-Skeleton in Three Dimensions

In two dimensions, the beta-skeleton is one of the most practical methods for reconstructing smooth curves from a given unorganized point set because of its provable guarantee. In three dimensions, however, the beta-skeleton cannot be used for surface reconstruction because it may contain unwanted holes omnipresently, no matter how high sampling density is. To overcome this difficulty, an extension of the beta-skeleton, called greedy beta-skeleton, is proposed. It is shown by computational experiments that the unwanted holes do not appear in the greedy beta-skeleton even when the dimension is three. In addition, the greedy beta-skeletons are computed for several practical inputs, and their fairness is examined. Computation results for some variants of the greedy beta-skeleton are also reported.

[1]  Kurt Mehlhorn,et al.  Traveling Salesman-Based Curve Reconstruction in Polynomial Time , 2001, SIAM J. Comput..

[2]  V. Ralph Algazi,et al.  Continuous skeleton computation by Voronoi diagram , 1991, CVGIP Image Underst..

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

[4]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..

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

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

[7]  J. O'Rourke,et al.  Connect-the-dots: a new heuristic , 1987 .

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

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

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

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

[12]  Chandrajit L. Bajaj,et al.  Sampling and reconstructing manifolds using alpha-shapes , 1997, CCCG.

[13]  Joachim Giesen.  Curve Reconstruction, the Traveling Salesman Problem, and Menger’s Theorem on Length , 2000 .

[14]  Jean-Daniel Boissonnat,et al.  Geometric structures for three-dimensional shape representation , 1984, TOGS.

[15]  D. Kirkpatrick,et al.  A Framework for Computational Morphology , 1985 .

[16]  Hisamoto Hiyoshi,et al.  Closed Curve Reconstruction from Unorganized Sample Points , 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

[17]  David Cohen-Steiner,et al.  A greedy Delaunay-based surface reconstruction algorithm , 2004, The Visual Computer.