Planar minimally rigid graphs and pseudo-triangulations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 154-163

  Haas, Ruth ^a   Orden, David ^b   Rote, Günter ^c   Santos, Francisco ^b   Servatius, Brigitte ^d   Servatius, Hermann ^d   Souvaine, Diane ^e   Streinu, Lleana ^a   Whiteley, Walter ^f  

^a SMITH COLLEGE   (United States)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

^d WORCESTER POLYTECHNIC INSTITUTE   (United States)

^e Tufts University   (United States)

^f YORK UNIVERSITY   (Canada)

Author keywords

Graph drawing; Pseudo triangulation; Rigidity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; TOPOLOGY;

PSEUDO-TRIANGULATIONS;

GRAPH THEORY;

EID: 0038714818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777817     Document Type: Conference Paper

References (48)

1. O. Aichholzer, F. Aurenhammer, H. Krasser and B. Speckmann. Convexity minimizes pseudo-triangulations, Proc. 14th Canad. Conf. Comp. Geom., pp. 158-161, 2002.
2. O. Aichholzer, B. Speckmann, G. Rote and I. Streinu. The zigzag path of a pseudo-triangulation, manuscript, 2003.
3. P. Agarwal, J. Basch, L. J. Guibas, J. Herschberger and L. Zhang. Deformable free space tilings for kinetic collision detection, in Algorithmic and Computational Robotics: New Directions, Proc. 5th Workshop Algor. Found. Robotics (WAFR), 2001, pp. 83-96.
4. A. Berg and T. Jordán. A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. to appear in J. Combinatorial Theory, Ser. B, 2003.
5. S. Bespamyatnikh. Enumerating pseudo-triangulations in the plane, in Proc. 14th Canad. Conf. Comp. Geom., 2002, pp. 162-166.
6. H. Brönnimann, L. Kettner, M. Pocchiola and J. Snoeyink. Counting and enumerating pseudo-triangulations with the greedy flip algorithm, manuscript, 2001.
7. M. Chrobak, M. Goodrich and R. Tamassia. Convex drawings of graphs in two and three dimensions, In Proc. 12th Ann. Sympos. Comput. Geom., 1996, pp. 319-328.
8. E. Colin de Verdière, M. Pocchiola and G. Vegter. Tutte's barycenter method applied to isotopies. In Proc. 13th Canad. Conf. Comput. Geom., August 2001. pp. 57-60. Extended version in ECG Report ECG-TR-124300-01, http://www-sop.inria.fr/ prisme/ECG/Results/Reports.html
9. R. Connelly, E. Demaine and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles, to appear, Discrete and Comp. Geometry, 2003. Preliminary version in Proc. 41st Symp. Found. of Comp. Science (FOCS), Redondo Beach, California, 2000, pp. 432-442.
10. G. Di Battista, P. Eades, R. Tamassia and I. Tollis. Graph Drawing, Prentice Hall, 1999.
11. T. Eren, W. Whiteley, A. Stephen Morse and P. Belhummeur. Sensor and Network Topologies of Formations with Distance-Direction Angle Constraints, submitted, March 2003.
12. I. Fáry, On straight lines representation of planar graphs, Acta Sci. Math. Szeged 11 (1948), 229-233.
13. S. Felsner. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18 (2001), 19-37.
14. M. S. Floater and C. Gotsman. How to morph tilings injectively, Journal of Computational and Applied Mathematics 101 (1999), 117-129.
15. H. de Fraysseix, J. Pach and R. Pollack. How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.
16. J. Graver, B. Servatius and H. Servatius. Combinatorial Rigidity, Graduate Studies in Mathematics, vol. 2, Amer. Math. Soc., 1993.
17. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (1985), 74-123.
18. L. Henneberg. Die graphische Statik der starren Systeme, Leipzig 1911, Johnson Reprint 1968.
19. J. E. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974), 549-568.
20. H. Imai. On combinatorial structures of line drawings of polyhedra, Discrete Applied Mathematics, 10 (1985), 79-92.
21. D. Jacobs, A. J. Rader, L. Kuhn, and M. Thorpe. Protein flexibility predictions using graph theory, Proteins 44 (2001), 150-165.
22. L. Kettner, D. Kirkpatrick, A. Mantler, J. Snoeyink, B. Speckmann and F. Takeuchi. Tight degree bounds for pseudo-triangulations of points, Comp. Geom. Theory Applications, 2003, to appear.
23. G. Laman. On graphs and rigidity of plane skeletal structures, J. Engineering Math. 4 (1970), 331-340.
24. R. J. Lipton, D. J. Rose and R. E. Tarjan. Generalized nested dissection, SIAM J. Numer. Anal. 16 (1979), 346-358.
25. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Conaput. 9, 1980, 615-627
26. N. Mnëv. On manifolds of combinatorial types of projective configurations and convex polyhedra, Soviet Math. Doklady 32 (1985), 335-337.
27. J. O'Rourke and I. Streinu. Vertex-edge pseudo-visibility graphs: characterization and recognition, in Proc. 13th ACM Symp. Comp. Geom, 1997, pp. 119-128.
28. J. Pach and G. Tóth. Monotone drawings of planar graphs, in: Algorithms and Computation (P. Bose, P. Morin, eds.) LNCS 2518, Springer Verlag, 2002, pp. 647-653.
29. M. Pocchiola and G. Vegter. Pseudo-triangulations: theory and applications, in Proc. 12th ACM Symp. Comput. Geometry, Philadelphia, 1996, pp. 291-300.
30. M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations, Discrete Comput. Geom. 16 (1996), 419-453.
31. D. Randall, G. Rote, F. Santos and J. Snoeyink Counting triangulations and pseudo-triangulations of wheels, in Proc. 13th Canad. Conf. Comput. Geom., 2001, pp. 149-152.
32. J. Richter-Gebert, Realization Spaces of Polytopes. Springer-Verlag, 1996.
33. G. Rote Two solvable cases of the traveling salesman problem, Ph.D. Thesis, Technische Universität Graz, Institut für Mathematik, 1988.
34. G. Rote, F. Santos and I. Streinu Expansive motions and the polytope of pointed pseudo-triangulations, in B. Aronov, S. Basu, J. Pach and M. Sharir (eds.), Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Springer Verlag, to appear, 2003.
35. B. Speckmann and C. Tóth. Allocating vertex πT-guards in simple polygons via pseudo-triangulations, in Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 109-118.
36. I. Streinu. Stretchability of star-like pseudo-visibility graphs, in Proc. 15th ACM Symp. Comput. Geometry, 1999, pp. 274-280.
37. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning, in Proc. 41st Symp. Found, of Comp. Science (FOCS), Redondo Beach, California, 2000, pp. 443-453.
38. I. Streinu. Combinatorial roadmaps in configuratio spaces of simple planar polygons, to appear in S. Basu and L. Gonzalez-Vega (eds.), Proc. DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2003.
39. W. Schnyder. Embedding planar graphs on the grid, in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 1990, pp. 138-148.
40. K. Sugihara. Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, Discrete Applied Mathematics, 10 (1985), 297-312.
41. R. E. Tarjan. Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM 1983.
42. T. S. Tay and W. Whiteley. Generating isostatic graphs, Structural Topology 11 (1985), 21-68.
43. M. F. Thorpe and P. M. Duxbury (eds.). Rigidity Theory and Applications, Kluwer Academic, 1999.
44. W. T. Tutte, How to draw a graph, Proc. London Math. Soc., III Ser. 13 (1963) 743-768.
45. W. T. Tutte, Convex representations of graphs, Proc. London Math. Soc., III Ser. 10 (1960), 304-320.
46. W. Whiteley. Rigidity of molecular structures: generic and geometric analysis, in Rigidity Theory and Applications (M. F. Thorpe and P. M. Duxbury, eds.), Kluwer, 1999, pp. 21-46.
47. W. Whiteley. Some matroids from discrete applied geometry, in J. E. Bonin et al. (ed.), Matroid theory, Contemporary Mathematics, vol. 197, Amer. Math. Soc., 1996, pp. 171-311.
48. W. Whiteley. Rigidity and scene analysis, in Handbook of Discrete and Computational Geometry, (J. E. Goodman, J. O'Rourke, eds.), 1997, pp. 893-916.