Combinatorial pseudo-triangulations
暂无分享,去创建一个
[1] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .
[2] Walter Whiteley,et al. Rigidity and scene analysis , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[3] Günter Rote,et al. Non-Crossing Frameworks with Non-Crossing Reciprocals , 2004, Discret. Comput. Geom..
[4] Günter Rote,et al. Planar minimally rigid graphs and pseudo-triangulations , 2003, SCG '03.
[5] Günter Rote,et al. Planar minimally rigid graphs and pseudo-triangulations , 2005, Comput. Geom..
[6] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .
[7] Francisco Santos,et al. The Polytope of Non-Crossing Graphs on a Planar Point Set , 2005, Discret. Comput. Geom..
[8] Francisco Santos,et al. The polytope of non-crossing graphs on a planar point set , 2004, ISSAC '04.
[9] Francisco Santos,et al. Expansive Motions and the Polytope of Pointed Pseudo-Triangulations , 2002 .
[10] Leonidas J. Guibas,et al. Ray shooting in polygons using geodesic triangulations , 1991, Algorithmica.
[11] Ileana Streinu,et al. A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[12] Michel Pocchiola,et al. Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..
[13] B. Aronov,et al. Discrete and computational geometry : the Goodman-Pollack Festschrift , 2003 .
[14] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .
[15] Brigitte Servatius,et al. Construction of self-dual graphs , 1992 .