论文信息 - An RNG-based heuristic for curve reconstruction

An RNG-based heuristic for curve reconstruction

In this paper we propose an RNG-based heuristic for curve reconstruction. Given a set of n sample points S, we first construct a relative neighbourhood graph on S, which is shown to contain all edges joining adjacent points on the unknown curve for an isin-sample with isin < 1/5. Next, we use a heuristic to remove non-adjacent edges. It is extremely simple and works remarkably well for sample points drawn from a large variety of curves.

Asish Mukhopadhyay | Augustus Das

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

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

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

[4] W.. Relative Neighborhood Graphs and Their Relatives , 2004 .

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

[6] Son Dinh Tran,et al. Reconstructing Curves without Delaunay Computation , 2004, Algorithmica.

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

[8] Christopher M. Gold,et al. Crust and anti-crust: a one-step boundary and skeleton extraction algorithm , 1999, SCG '99.

[9] Joachim Giesen. Curve Reconstruction, the Traveling Salesman Problem, and Menger's Theorem on Length , 2000, Discret. Comput. Geom..

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

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

[12] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..