The polytope of non-crossing graphs on a planar point set

DOI10.1145/1005285.1005322MaRDI QIDQ4657333zbMATH OpenOpenAlexFDO

Authors David Orden, Francisco Santos

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005322

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics of partially ordered sets (06A07)

Recommendations

• The polytope of non-crossing graphs on a planar point set
• Enumerating pseudo-triangulations in the plane
• Multitriangulations as complexes of star polygons
• Connectivity of triangulation flip graphs in the plane

Cited in

(8)

• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
• Non-crossing matchings of points with geometric objects
• Pre-triangulations and liftable complexes
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• The polytope of non-crossing graphs on a planar point set
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• Multitriangulations as complexes of star polygons
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

This page was built for publication: The polytope of non-crossing graphs on a planar point set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657333)