Matching edges and faces in polygonal partitions

Computational Geometry: Theory and Applications

Volumn 39, Issue 2, 2008, Pages 134-141

  Aichholzer, O ^a   Aurenhammer, F ^a   Gonzalez Nava, P ^a   Hackl, T ^a   Huemer, C ^b   Hurtado, F ^b   Krasser, H ^a   Ray, S ^c   Vogtenhuber, B ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Laman condition; Perfect matching; Polygonal partition; Pseudo triangulation; Quadrangulation; Tree decomposition

Indexed keywords

EID: 84867925566     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.07.002     Document Type: Article

References (16)

1. O. Aichholzer, F. Aurenhammer, H. Krasser, and P. Brass Pseudo-triangulations from surfaces and a novel type of edge flip SIAM J. Comput. 32 2003 1621 1653
2. O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu Triangulations intersect nicely Discrete Comput. Geom. 16 1996 339 359
3. M.O. Albertson, and R. Haas Bounding functions and rigid graphs SIAM J. Discrete Math. 9 1996 269 273
4. F. Aurenhammer Power diagrams: Properties, algorithms, and applications SIAM J. Comput. 16 1987 78 96
5. B. Bollobás Graph Theory An Introductory Course 1979 Springer-Verlag Berlin
6. B. Grünbaum Convex Polytopes 1967 Wiley Interscience London
7. R. Haas Characterizations of arboricity of graphs Ars Combin. 63 2002 129 137
8. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, and W. Whiteley Planar minimally rigid graphs and pseudo-triangulations Comput. Geom.: Theory Appl. 31 2005 31 61
9. G.R. Kampen Orienting planar graphs Discrete Math. 14 1976 337 341
10. G. Laman On graphs and rigidity of plane skeletal structures J. Engrg. Math. 4 1970 331 340
11. C.S.J. Nash-Williams Edge disjoint spanning trees of finite graphs J. London Math. Soc. 36 1961 445 450
12. D. Orden, Two problems in geometric combinatorics: Efficient triangulations of the hypercube; planar graphs and rigidity, PhD Thesis, Universidad de Cantabria, Spain, 2003
13. D. Orden, F. Santos, B. Servatius, and H. Servatius Combinatorial pseudo-triangulations Discrete Math. 307 2007 554 566
14. W. Schnyder, Embedding planar graphs on the grid, in: Proc. 1st ACM-SIAM Symp. Discrete Algorithms, 1990, pp. 138-148
15. I. Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, in: Proc. 41st IEEE Symp. FOCS, 2000, pp. 443-453
16. W.T. Tutte On the problem of decomposing a graph into n connected factors J. London Math. Soc. 36 1961 221 230