Pseudo-triangulations -- a survey

MaRDI QIDQ3514529zbMATH OpenFDO

Authors Günter Rote, Ileana Streinu, Francisco Santos

Publication date 21 July 2008

Full work available at URL https://arxiv.org/abs/math/0612672

zbMATH Keywords

computational geometryplanar graphpolytopepseudo-triangulationrigiditytriangulation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph representations (geometric and intersection representations, etc.) (05C62) (n)-dimensional polytopes (52B11) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Enumerating pseudo-triangulations in the plane
• Planar minimally rigid graphs and pseudo-triangulations
• Combinatorial pseudo-triangulations
• On numbers of pseudo-triangulations
• Planar minimally rigid graphs and pseudo-triangulations

Cited in

(36)

• Multitriangulations as complexes of star polygons
• Planar minimally rigid graphs and pseudo-triangulations
• On numbers of pseudo-triangulations
• The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
• Brick polytopes of spherical subword complexes and generalized associahedra
• Plane graphs with parity constraints
• Pre-triangulations and liftable complexes
• On the number of pseudo-triangulations of certain point sets
• Flip graphs of bounded degree triangulations
• Resolving Loads with Positive Interior Stresses
• A Hopf algebra of subword complexes
• On pseudo-convex partitions of a planar point set
• Pointed spherical tilings and hyperbolic virtual polytopes
• The brick polytope of a sorting network
• On k-convex polygons
• scientific article; zbMATH DE number 2009873 (Why is no real title available?)
• Multitriangulations, pseudotriangulations and primitive sorting networks
• Pointed drawings of planar graphs
• Geodesic order types
• The diameter of type \(D\) associahedra and the non-leaving-face property
• Recognizing planar Laman graphs
• One brick at a time: a survey of inductive constructions in rigidity theory
• Spatial embedding of pseudo-triangulations
• Planar minimally rigid graphs and pseudo-triangulations
• Triangulations of Line Segment Sets in the Plane
• Acute triangulations of polygons
• Convexity minimizes pseudo-triangulations
• Celebrating Loday's associahedron
• Flips in edge-labelled pseudo-triangulations
• Wigglyhedra
• Computing pseudotriangulations via branched coverings
• Empty pseudo-triangles in point sets
• Pseudo-simplicial complexes from maximal locally convex functions
• Combinatorial pseudo-triangulations
• Cluster algebras of type \(D\): pseudotriangulations approach
• Flattening single-vertex origami: The non-expansive case

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)