Combinatorial pseudo-triangulations

Discrete Mathematics

Volumn 307, Issue 3-5, 2007, Pages 554-566

  Orden, David ^a   Santos, Francisco ^b   Servatius, Brigitte ^c   Servatius, Herman ^c  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c Life Science and Bioengineering Center   (United States)

Author keywords

Combinatorial pseudo triangulations; Pseudo triangulations; Rigidity

Indexed keywords

COMPUTATIONAL GEOMETRY; NUMERICAL METHODS; TRIANGULATION;

COMBINATORIAL PSEUDO-TRIANGULATIONS (CPT); PLANAR GRAPH; PSEUDO-TRIANGULATIONS;

GRAPH THEORY;

EID: 33845613240     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.09.045     Document Type: Article

References (13)

1. Chazelle B., Edelsbrunner H., Grigni M., Guibas L., Erschberger J., and Sharir M. Ray shooting in polygons using geodesic triangulations. Algorithmica 12 1 (1994) 54-68
2. Christopher P., and Servatius B. Construction of self-dual graphs. Amer. Math. Monthly 99 2 (1992) 153-158
3. J. Graver, B. Servatius, H. Servatius, Combinatorial Rigidity, Graduate Studies in Mathematics, vol. 2, AMS, Providence, RI, 1993.
4. Haas R., Orden D., Rote G., Santos F., Servatius B., Servatius H., Souvaine D., Streinu I., and Whiteley W. Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31 1-2 (2005) 31-61
5. Laman G. On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4 (1970) 331-340
6. Maxwell J.C. On reciprocal figures and diagrams of forces. Philos. Mag. Series 4 27 (1864) 250-261
7. D. Orden, Two problems in geometric combinatorics: efficient triangulations of the hypercube; planar graphs and rigidity, Ph.D. Thesis, Universidad de Cantabria, 2003.
8. Orden D., Rote G., Santos F., Servatius B., Servatius H., and Whiteley W. Non-crossing frameworks with non-crossing reciprocals. Discrete and Computational Geometry (special issue in honor of Lou Billera) 32 4 (2004) 567-600
9. Orden D., and Santos F. The polytope of non-crossing graphs on a planar point set. Discrete Comput. Geom. 33 2 (2005) 275-305
10. Pocchiola M., and Vegter G. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom. 16 (1996) 419-453
11. G. Rote, F. Santos, I. Streinu, Expansive motions and the polytope of pointed pseudo-triangulations, in: B. Aronov, S. Basu, J. Pach, M. Sharir (Eds.), Discrete and Computational Geometry-The Goodman-Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Springer, Berlin, 2003, pp. 699-736.
12. I. Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, in: Proceedings of 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, CA, 2000, pp. 443-453.
13. Whiteley W. Rigidity and scene analysis. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of Discrete and Computational Geometry (1997) 893-916