Curve reconstruction from noisy samples

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 302-311

  Cheng, Siu Wing ^a   Funke, Stefan ^b   Golin, Mordecai ^a   Kumar, Piyush ^d   Poon, Sheung Hung ^a   Ramos, Edgar ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b MPI for Informatics   (Germany)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d NONE

Author keywords

Curve reconstruction; Probabilistic analysis; Sampling

Indexed keywords

ALGORITHMS; PERTURBATION TECHNIQUES; PROBABILITY; SAMPLING; SET THEORY;

PROBABILISTIC ANALYSIS;

PROBLEM SOLVING;

EID: 0037700433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777838     Document Type: Conference Paper

References (11)

1. P. K. Agarwal, C. M. Procopiuc and K. Varadarajan. Approximation algorithms for k-line center. Proc. 10th Annu. European Sympos. Alg., 2002.
2. E. Althaus and K. Mehlhorn. Traveling salesman based curve reconstruction in polynomial time. SIAM J. Comput., 31 (2001), 27-66.
3. N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, 60 (1998), 125-135.
4. T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. Proc. 10th. Annu. ACM-SIAM Sympos. Discrete Alg., 1999, 893-894.
5. T. K. Dey, K. Mehlhorn and E. Ramos. Curve reconstruction: connecting dots with good reason. Comput. Geom. Theory & Appl., 15 (2000), 229-244.
6. T. K. Dey and R. Wenger. Reconstructing curves with sharp corners. Comput. Geom. Theory & Appl., 19 (2001), 89-99.
7. T. K. Dey and R. Wenger. Fast reconstruction of curves with sharp corners. Comput. Geom. Theory & Appl., 12 (2002), 353-400.
8. M. Habib, C. McDiarmid, J.Ramirez-Alfonsin and B.Reed. Probabilistic Methods for Algorithmic Discrete Mathematics. Springer Verlag Belin Heidelberg, 1998, 198-200.
9. S. Funke and E. A. Ramos. Reconstructing a collection of curves with corners and endpoints. Proc. 12th Annu. ACM-SIAM Sympos. Discrete Alg., 2001, 344-353.
10. J. Giesen. Curve reconstruction, the Traveling Salesman Problem and Monger's Theorem on length. Discrete & Comp. Geom., 24 (2000), 577-603.
11. C. Gold and J. Snoeyink. A one-step crust and skeleton extraction algorithm. Algorithmica, 30 (2001), 144-163.