| Contemporary Mathematics Pseudo-Triangulations — a Survey (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. A pseudo-triangle is a simple polygon with exactly three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as planar bar-and-joint frameworks in rigidity theory and as projections of locally convex surfaces. This survey of current literature includes combinatorial properties and counting of special classes, rigidity theoretical results, representations as polytopes, straight-line drawings from abstract versions called combinatorial pseudo-triangulations, algorithms and applications of pseudo-triangulations. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||