Download:
|
by Ernst Althaus, Kurt Mehlhorn, Stefan Schirra
In Proc. 2nd Workshop Algorithm Eng. Exper
http://www.mpi-sb.mpg.de/~mehlhorn/ftp/exp-curve.ps
Add To MetaCart
Abstract:
An instance of the curve reconstruction problem is a nite sample V of an unknown curve . The task is to connect the points in V in the order in which they lie on . Several new algorithms for the curve reconstruction problem have been proposed in recent years. All algorithms compute a subgraph of the Delaunay triangulation of V. Most algorithms make the decisions of which edges to put into the reconstructions locally and run in time O(n log n) worst case, one algorithm uses a global criterion and computes the traveling salesman tour of V. Our implementation of this algorithm has exponential worst case running time. Our experiments show that the TSPalgorithm is far superior with respect to reconstruction quality. In our experiments its running time was never more than 13 times the running time of the fastest of the other algorithms. We also describe an experimental platform for curve reconstruction algorithms.
Citations
|
971
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
550
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Mehlhorn, Näher
- 2000
|
|
135
|
Combinatorial Optimization
– Cook, Cunningham, et al.
- 1998
|
|
122
|
Fast algorithms for geometric traveling salesman problems
– Bentley
- 1992
|
|
93
|
On the shape of a set of points in the plane
– Edelsbrunner, Kirkpatrick, et al.
- 1983
|
|
70
|
A framework for computational morphology
– Kirkpatrick, Radke
- 1985
|
|
61
|
r-regular shape reconstruction from unorganized points
– Attali
- 1997
|
|
45
|
A faster divide-and-conquer algorithm for constructing Delaunay triangulations
– Dwyer
- 1987
|
|
37
|
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
– Gold
- 1999
|
|
34
|
A simple provable algorithm for curve reconstruction
– Dey, Kumar
- 1999
|
|
33
|
Curve reconstruction: connecting dots with good reason
– Dey, Mehlhorn, et al.
- 1999
|
|
21
|
reconstruction with Delaunay complex
– EDELSBRUNNER
- 1998
|
|
16
|
Curve reconstruction, the TSP, and Menger's theorem on length
– Giesen
- 1999
|
|
14
|
The crust and the Combinatorial curve reconstruction
– Amenta, Bern, et al.
- 1998
|
|
11
|
Computational morphology of curves
– Figueiredo, Gomes
- 1994
|
|
10
|
Sampling and reconstructing manifolds using -shapes
– Bernardini, Bajaj
- 1997
|
|
9
|
Polynomial time TSP-based curve reconstruction
– Althaus, Mehlhorn
- 2000
|
|
3
|
a library of ecient data types and algorithms. Report A 04/89, Univ. Saarlandes
– LEDA
- 1989
|
|
1
|
And CUt System. www.informatik.uni-koeln.de/ls_juenger/ projects/abacus.html
– Branch
|
|
1
|
Regularity Considerations in Curve Reconstruction with Delaunay Complex. unpuplished
– Giesen
- 1999
|
