Pseudo-triangulations -- a survey
zbMATH Open1169.05027arXivmath/0612672MaRDI QIDQ3514529FDOQ3514529
Authors: Günter Rote, Ileana Streinu, Francisco Santos 
Publication date: 21 July 2008
Full work available at URL: https://arxiv.org/abs/math/0612672
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) (n)-dimensional polytopes (52B11) Graph representations (geometric and intersection representations, etc.) (05C62) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cited In (35)
- Pointed spherical tilings and hyperbolic virtual polytopes
- Plane graphs with parity constraints
- Acute triangulations of polygons
- The brick polytope of a sorting network
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Triangulations of Line Segment Sets in the Plane
- Flattening single-vertex origami: The non-expansive case
- Planar minimally rigid graphs and pseudo-triangulations
- Combinatorial pseudo-triangulations
- Recognizing planar Laman graphs
- Pre-triangulations and liftable complexes
- The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
- Flip graphs of bounded degree triangulations
- Pointed drawings of planar graphs
- On numbers of pseudo-triangulations
- Title not available (Why is that?)
- On \(k\)-convex polygons
- Empty pseudo-triangles in point sets
- One brick at a time: a survey of inductive constructions in rigidity theory
- Planar minimally rigid graphs and pseudo-triangulations
- A Hopf algebra of subword complexes
- Brick polytopes of spherical subword complexes and generalized associahedra
- Geodesic order types
- On the number of pseudo-triangulations of certain point sets
- Cluster algebras of type \(D\): pseudotriangulations approach
- Resolving Loads with Positive Interior Stresses
- Multitriangulations as complexes of star polygons
- The diameter of type \(D\) associahedra and the non-leaving-face property
- Convexity minimizes pseudo-triangulations
- Celebrating Loday's associahedron
- Spatial embedding of pseudo-triangulations
- Pseudo-simplicial complexes from maximal locally convex functions
- On pseudo-convex partitions of a planar point set
- Computing pseudotriangulations via branched coverings
- Flips in edge-labelled pseudo-triangulations
This page was built for publication: Pseudo-triangulations -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514529)
