New results on lower bounds for the number of \((\leq k)\)-facets

DOI10.1016/j.ejc.2009.03.010zbMath1181.52016arXiv0801.1036OpenAlexW1536383987MaRDI QIDQ1039428

David Orden, Oswin Aichholzer, Pedro A. Ramos, Jesús García-López

Publication date: 30 November 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

rectilinear crossing number\((\leq k)\)-edge\((\leq k)\)-facet\(k\)-facetnumber of convex quadrilateralssimplicial half-net

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10)

Related Items

\(k\)-sets and rectilinear crossings in complete uniform hypergraphs, Energy Considerations for the Stabilization of Constrained Mechanical Systems with Velocity Projection

Cites Work

• Unnamed Item
• Unnamed Item
• \(\epsilon\)-nets and simplex range queries
• Circles through two points that always enclose many points
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• A lower bound for the rectilinear crossing number
• Research Problems in Discrete Geometry
• Graph Drawing