Finding the medial axis of a simple polygon in linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 382-391

  Chin, Francis ^a   Snoeyink, Jack ^b   Wang, Cao An ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

DETERMINISTIC ALGORITHMS; LINEAR TIME; LINEAR-TIME ALGORITHMS; MEDIAL AXES; MEDIAL AXIS; NORMAL HISTOGRAM; SIMPLE POLYGON;

GRAPHIC METHODS;

EID: 84955575514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015444     Document Type: Conference Paper

References (19)

1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Disc. & Comp. Geom., 4:591-604, 1989.
2. F. Aurenhammer. Voronoi diagrams—A survey of a fundamental geometric data structure. ACM Comp. Surveys, 23(3):345-405, 1991.
3. H. Blum. A transformation for extracting new descriptors of shape. In W. Whaten-Dunn, editor, Proc. Symp. Models for Perception of Speech and Visual Form, pages 362-380. MIT Press, 1967.
4. B. Chazelle. Triangulating a simple polygon in linear time. Disc. & Comp. Geom., 6:485-524, 1991.
5. O. Devillers. Randomization yields simple 0(n log* n) algorithms for difficult ft(n) problems. Int. J. Comp. Geom. App., 2(1):97-111, 1992.
6. H. Djidjev and A. Lingas. On computing the Voronoi diagram for restricted planar figures. In WADS ’91: Second Workshop on Data Structures and Algorithms, number 519 in LNCS, pages 54-64. Springer-Verlag, 1991.
7. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
8. H. N. Giirsoy and N. M. Patrikalakis. An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part I algorithm. Engineering with Computers, 8:121-137, 1992.
9. M. Held. On the Computational Geometry of Pocket Machining. Number 500 in LNCS. Springer-Verlag, 1991.
10. D. G. Kirkpatrick. Efficient computation of continuous skeletons. In Proc. 18th FOCS, pages 162-170, 1977.
11. R. Klein and A. Lingas. A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon. In Proc. 9th Ann. ACM Symp. Comp. Geom., pages 124-132, 1993.
12. R. Klein and A. Lingas. Fast skeleton construction. To appear, Proc. 3rd Europ. Symp. on Alg. (ESA’95), 1995.
13. D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pat. Anal. Mach. Int., PAMI-4(4):363-369, 1982.
14. S. Lu, H. Xu, and C. Wang. Detecting and eliminating false strokes in skeletons by geometric analysis. In SPIE’s OE/Technology’92, Vision Geometry, Boston, Nov. 1992.
15. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, 1992.
16. A. Rosenfeld. Axial representation of shape. Comp. Vis. Graph. Image Proc, 33:156-173, 1986.
17. M. I. Shamos and D. Hoey. Closest point problems. In Proc. 16th FOCS, pages 151-162, 1975.
18. P. Vermeer. Two-dimensional mat to boundary conversion. In Proc. 2nd Symp. Solid Model. Appi, pages 493-494, 1993.
19. C. A. Wang and F. Chin. Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. To appear, Proc. 3rd Europ. Symp. on Alg. (ESA ’95), 1995.