Discrete and Computational Geometry
From MaRDI portal
Publication:5897097
DOI10.1007/b11261zbMath1179.52004OpenAlexW62175113MaRDI QIDQ5897097
Publication date: 5 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11261
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (5)
A result of the existence with three types of interior points ⋮ On the existence of a point subset with three or five interior points ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ More on planar point subsets with a specified number of interior points ⋮ More on an Erdős-Szekeres-type problem for interior points
This page was built for publication: Discrete and Computational Geometry
