论文信息 - A simple provable algorithm for curve reconstruction

A simple provable algorithm for curve reconstruction

We present an algorithm that provably reconstructs a curve in the framework introduced by Amenta, Bern and Eppstein. The highlights of the algorithm are: (i) it is simple, (ii) it requires a sampling density better than previously known, (iii) it can be adapted for curve reconstruction in higher dimensions straightforwardly.

Tamal K. Dey | Piyush Kumar | T. Dey | Piyush Kumar | T. Dey

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

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

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

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

[5] Mahmoud Melkemi. A-shapes of a finite point set , 1997, SCG '97.

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

[7] Herbert Edelsbrunner,et al. Shape Reconstruction with Delaunay Complex , 1998, LATIN.