Binary Space Partitions for Fat Rectangles

DOI10.1137/S0097539797320578zbMath0959.65039OpenAlexW2171708854MaRDI QIDQ4943877

Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter, Pankaj K. Agarwal

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797320578

zbMATH Keywords

performancealgorithmcomputational geometryaspect ratiohidden-surface removalbinary space partitionsfat rectangles

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Cuttings for disks and axis-aligned rectangles in three-space ⋮ Eliminating depth cycles among triangles in three dimensions ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ Binary plane partitions for disjoint line segments ⋮ Approximate range searching using binary space partitions

This page was built for publication: Binary Space Partitions for Fat Rectangles