Monotone Paths in Planar Convex Subdivisions and Polytopes

DOI10.1007/978-3-319-00200-2_6zbMath1275.52019OpenAlexW2106220493MaRDI QIDQ2848994

Günter Rote, Adrian Dumitrescu, Csaba D. Tóth

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_6

zbMATH Keywords

convex polytopegeometric graphmonotone pathconvex subdivision

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (3)

Counting carambolas ⋮ Partial-matching RMS distance under translation: combinatorics and algorithms ⋮ Monotone paths in geometric triangulations

Cites Work

• A counterexample to the Hirsch conjecture
• Convex subdivisions with low stabbing numbers
• A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)
• The complexity of cutting complexes
• Long monotone paths in line arrangements
• Long monotone paths on simple 4-polytopes
• On some monotone path problems in line arrangements
• Heights of convex polytopes
• Monotone Paths in Planar Convex Subdivisions
• The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
• On the Monotone Upper Bound Problem
• The maximum numbers of faces of a convex polytope

This page was built for publication: Monotone Paths in Planar Convex Subdivisions and Polytopes