Finding the medial axis of a simple polygon in linear time

Discrete and Computational Geometry

Volumn 21, Issue 3, 1999, Pages 405-420

  Chin, F ^c   Snoeyink, J ^a   Wang, C A ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033423090     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009429     Document Type: Article

References (29)

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. Discrete Comput. Geom., 4:591-604, 1989.
2. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. 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, Cambridge MA, 1967.
4. L. Calabi and W. E. Hartnett. Shape recognition, prairie fires, convex deficiences and skeletons. Amer. Math. Monthly, 75:335-342, 1968.
5. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
6. O. Devillers. Randomization yields simple O(n log* n) algorithms for difficult Ω(n) problems. Internat. J. Comput. Geom. Appl., 2(1):97-111, 1992.
7. 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, Berlin, 1991.
8. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
9. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9(1):66-104, 1990.
10. H. N. Gürsoy and N. M. Patrikalakis. An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part I, algorithm. Engrg. Comput., 8:121-137, 1992.
11. M. Held. On the Computational Geometry of Pocket Machining. Number 500 in LNCS. Springer-Verlag, Berlin, 1991.
12. D. G. Kirkpatrick. Efficient computation of continuous skeletons. In Proc. 18ht FOCS, pages 162-170, 1977.
13. R. Klein. Concrete and Abstract Voronoi Diagrams. Number 400 in LNCS. Springer-Verlag, Berlin, 1989.
14. 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.
15. R. Klein and A. Lingas. Fast skeleton construction. In P. Spirakis, editor, Algorithms-ESA '95, number 979 in LNCS, pages 582-595. Springer-Verlag, Belin, 1995.
16. R. Klein, K. Mehlhorn, and S. Meiser. Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl., 3(3):157-184, 1993.
17. D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intell., 4(4):363-369, 1982.
18. S. Lu, H. Xu, and C. Wang. Detecting and eliminating false strokes in skeletons by geometric analysis. In Vision Geometry, SPIE Proc., Volume 1832, pages 312-323, 1993.
19. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom., 15:73-105, 1996.
20. K. Mehlhorn, S. Meiser, and C. Ó'Dúnlaing. On the construction of abstract Voronoi diagrams. Discrete Comput. Geom., 6:211-224, 1991.
21. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, New York, 1992.
22. T. Pavlidis. A review of algorithms for shape analysis. Comput. Graph. Image Process, 7:243-258, 1978.
23. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer-Verlag, New York, 1985.
24. A. Rosenfeld. Axial representation of shape. Comput. Vis. Graph. Image Process, 33:156-173, 1986.
25. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. CompUT. Geom. Theory Appl., 1:51-64, 1991.
26. M. I. Shamos and D. Hoey. Closest point problems. In Proc. 16th FOCS, pages 151-162, 1975.
27. P. Vermeer. Two-dimensional MAT to boundary conversion. In Proc. 2nd Symp. Solid Model. Appl., pages 493-494, 1993.
28. C. A. Wang and F. Chin. Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. In P. Spirakis, editor, Algorithms - ESA '95, number 979 in LNCS, pages 280-294. Springer-Verlag, Berlin, 1995.
29. C. K. Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom., 2:365-393, 1987.