TSP-Based Curve Reconstruction
Problem Definition
An instance of the curve reconstruction problem is a finite set of sample points V in the plane, which are assumed to be taken from an unknown planar curve γ. The task is to construct a geometric graph G on V such that two points in V are connected by an edge in G if and only if the points are adjacent on γ. The curve γ may consist of one or more connected components, and each of them may be closed or open (with endpoints), and may be smooth everywhere (tangent defined at every point) or not.
Many heuristic approaches have been proposed to solve this problem. This work continues a line of reconstruction algorithms with guaranteed performance, i. e. algorithms which probably solve the reconstruction problem under certain assumptions of γ and V. Previous proposed solutions with guaranteed performances were mostly local: a subgraph of the complete geometric graph defined by the points is considered (in most cases the Delaunay edges), and then filteredusing a local...
Recommended Reading
- 1.Althaus, E., Mehlhorn, K.: Traveling salesman-based curve reconstruction in polynomial time. SIAM J. Comput. 31, 27–66 (2001)MathSciNetMATHGoogle Scholar
- 2.Althaus, E., Mehlhorn, K., Näher, S., Schirra, S.: Experiments on curve reconstruction. In: ALENEX, 2000, pp. 103–114Google Scholar
- 3.Amenta, N., Bern, M.: Surface reconstruction by Voronoi filtering. Discret. Comput. Geom. 22, 481–504 (1999)MathSciNetMATHGoogle Scholar
- 4.Amenta, N., Bern, M., Eppstein, D.: The crust and the β‑skeleton: Combinatorial curve reconstruction. Graph. Model. Image Process. 60, 125–135 (1998)Google Scholar
- 5.Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)MATHGoogle Scholar
- 6.Dey, T.K.: Curve and surface reconstruction. In: Goodman, J.E., O'Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. CRC, Boca Raton (2004)Google Scholar
- 7.Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, New York (2006)Google Scholar
- 8.Edlesbrunner, H.: Shape reconstruction with the Delaunay complex. In: LATIN'98, Theoretical Informatics. Lecture Notes in Computer Science, vol. 1380, pp. 119–132. Springer, Berlin (1998)Google Scholar
- 9.Giesen, J.: Curve reconstruction, the TSP, and Menger's theorem on length. Discret. Comput. Geom. 24, 577–603 (2000)MathSciNetMATHGoogle Scholar
- 10.Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)MATHGoogle Scholar