Closed curve reconstruction from unorganized sample points

Proceedings - 3rd International Symposium on Voronoi Diagrams in Science and Engineering 2006, ISVD 2006

Volumn , Issue , 2006, Pages 122-131

  Hiyoshi, Hisamoto ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PROBLEM SOLVING;

COMPUTATIONAL TIME; POLYGONAL RECONSTRUCTION; SCISSORS;

CURVE FITTING;

EID: 34250331611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVD.2006.14     Document Type: Conference Paper

References (10)

1. K. S. A. Okabe, B. Boots and S.-N. Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, second edition, 2000.
2. H. Blum. A transformation for extracting new descriptors of shape. In W. Walthen-Dunn, editor, Models for the Perception of Speech and Visual Form, pages 362-380. MIT Press, Boston, 1967.
3. H. Blum. Bilological shape and visual science (part I). Journal of Theoretical. Biology, 38:205-287, 1973.
4. T. K. Dey and R. Wenger. Reconstructing curves with sharp comers. Computational Geometry: Theory and Applications, 19:89-99, 2001.
5. C. M. Gold and J. Snoeyink. A one-step crust and skeleton extraction algorithm. Algorithmica, 30:144-163, 2001.
6. H. B. J. O'Rourke and R. Washington. Connect-the-dots: a new heuristic. Computer Vision, Graphics, and Image Processing, 39:258-266, 1987.
7. D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. Toussaint, editor, Computational Geometry, pages 217-248. North-Holland, Amsterdam, 1985.
8. M. B. N. Amenta and D. Eppstein. The crust and the betaskeleton: combinatorial curve reconstruction. Graphical. Models and Image Processing, 60:125-135, 1998.
9. G. L. Nemhauser, A. G. Rinnooy Kan, and M. J. Todd, editors. Optimization, volume 1 of Handbooks in Operations Research and Management Science. Elsevier, Amsterdam, 1989.
10. G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12:261-268, 1980.