Pseudo-Triangulations - a Survey
摘要
A pseudo-triangle is a simple polygon with 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.
引用
@article{arxiv.math/0612672,
title = {Pseudo-Triangulations - a Survey},
author = {Guenter Rote and Francisco Santos and Ileana Streinu},
journal= {arXiv preprint arXiv:math/0612672},
year = {2015}
}
备注
68 pages, 36 figures. To appear in "Proceedings of the Joint Summer Research Conference on Discrete and Computational Geometry", Edited by J. E. Goodman, J. Pach, and R. Pollack, Contemporary Mathematics, AMS