Improved bounds for intersecting triangles and halving planes
From MaRDI portal
Publication:1208053
DOI10.1016/0097-3165(93)90082-JzbMath0769.68122OpenAlexW2020799482MaRDI QIDQ1208053
Publication date: 16 May 1993
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(93)90082-j
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Counting triangle crossings and halving planes ⋮ Stabbing simplices by points and flats ⋮ Cutting dense point sets in half ⋮ On levels in arrangements of surfaces in three dimensions ⋮ Upper bounds for stabbing simplices by a line ⋮ Lower bounds for weak epsilon-nets and stair-convexity ⋮ Crossing-free segments and triangles in point configurations ⋮ Eppstein's bound on intersecting triangles revisited
Cites Work
This page was built for publication: Improved bounds for intersecting triangles and halving planes