Polygon decomposition based on the straight line skeleton

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 58-67

  Tǎnase, Mirela ^a   Veltkamp, Remco C ^a  

^a Inst of Info/Computing Sciences   (Netherlands)

Author keywords

Polygonal decomposition; Straight line skeleton

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; COMPUTER VISION; THEOREM PROVING;

POLYGONAL DECOMPOSITION;

COMPUTATIONAL GEOMETRY;

EID: 0038038330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Hoffman, D., Richards, W.: Parts of Recognition. Cognition 18 (1984) 65-96.
2. Blum, H.: A Transformation for Extracting New Descriptors of Shape. Symposium Models for Speech and Visual Form. ed: W. Wathen-Dunn. MIT Press (1967) 362-381.
3. Brady, M., Asada, H.: Smoothed Local Symmetries and their Implementation. The International Journal of Robotics Research 3(3) (1984) 36-61.
4. Aichholzer, O., Aurenhammer, F.: Straight Skeletons for General Polygonal Figures in the Plane. In: Proc. 2nd International Computing and Combinatorics Conference COCOON '96. Lecture Notes in Computer Science, Vol. 1090. Springer-Verlag (1996) 117-126.
5. Arkin, E., Chew, P., Huttenlocher, D., Kedem, K., Mitchel, J.: An Efficiently Computable Metric for Comparing Polygonal Shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(3) (1991) 209-215.
6. Ogniewicz, R. L., Kubler, O.: Hierarchic Voronoi Skeletons. Pattern Recognition 28(3) (1995) 343-359.
7. Simmons, M., Séquin,C. H.: 2D Shape Decomposition and the Automatic Generation of Hierarchical Representations. International Journal of Shape Modeling 4 (1998) 63-78.
8. Siddiqi, K., Kimia, B.: Parts of Visual Form: Computational Aspects. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(3) (1995) 239-251.
9. Kimia, B.B., Tannenbaum, A.R., Zucker, S.W.: Shapes, Shocks, and Deformations I: The Components of Two-Dimensional Shape and the Reaction-Diffusion Space. International Journal of Computer Vision 15(3) (1995) 189-224.
10. Siddiqi, K., Shokoufandeh, A., Dickinson, S.J., Zucker, S.W. Shock Graphs and Shape Matching. International Journal of Computer Vision 35(1) (1999) 13-32.
11. Latecki, L.J., Lakämper, R.: Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution. Computer Vision and Image Understanding 73(3) (1999) 441-454.
12. Keil, J.M.: Polygon Decomposition In: J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier (1999) 491-518.
13. Eppstein, D., Erickson, J.: Raising Roofs, Crashing Cycles, and playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete and Computational Geometry 22(4) (1999) 569-592.
14. Chin, F., Snoeyink, J., Wang, C.-A.: Finding the Medial Axis of a Simple Polygon in Linear Time. Discrete Computational Geometry 21(3) (1999) 405-420.
15. Cheng, S.-W., Vigneron, A: Motorcycle Graphs and Straight Skeletons. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms (2002) 156-165.
16. Goodrich, M.T., Tamassia, R.: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. Journal of Algorithms 23(1) (1997) 51-73.
17. Felkel, P., Obdržálek, Š.: Straight Skeleton Implementation. In: Proc. of Spring Conference on Computer Graphics, Budmerice, Slovakia (1998) 210-218.
18. The Computational Geometry Algorithms Library. http://www.cgal.org/.
19. SQUID database. http://www.ee.surrey.ac.uk/Research/VSSP/imagedb/demo.html.
20. Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. The Canadian Cartographer 10(2) (1973) 112-122.