论文信息 - Computational Geometry Column 43 - 字舞流文

Computational Geometry Column 43

The concept of pointed pseudo-triangulations is defined and a few of its applications described.

Joseph O'Rourke

[1] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[2] Michel Pocchiola,et al. Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.

[3] Bettina Speckmann,et al. Kinetic collision detection for simple polygons , 2000, SCG '00.

[4] Bettina Speckmann,et al. Tight degree bounds for pseudo-triangulations of points , 2001, CCCG.

[5] Michel Pocchiola,et al. Pseudo-triangulations: theory and applications , 1996, SCG '96.

[6] Günter Rote,et al. Counting triangulations and pseudo-triangulations of wheels , 2001, CCCG.

[7] Francisco Santos,et al. Expansive Motions and the Polytope of Pointed Pseudo-Triangulations , 2002 .

[8] Bettina Speckmann,et al. Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations , 2003, SODA '03.

[9] Joseph O'Rourke. Computational geometry column 39 , 2000, SIGA.

[10] Günter Rote,et al. Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[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.