On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3

DOI10.1007/978-3-642-40450-4_46zbMath1395.68150OpenAlexW103607126MaRDI QIDQ2849344

Panos Giannopoulos, Christian Knauer, Daniel Werner

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_46

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Erd?s problems and related topics of discrete geometry (52C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Related Items (4)

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ Convex polygons in Cartesian products

This page was built for publication: On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3