Binary Space Partitions for Fat Rectangles
From MaRDI portal
Recommendations
Cited in
(16)- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Binary plane partitions for disjoint line segments
- Cuttings for disks and axis-aligned rectangles in three-space
- Efficient binary space partitions for hidden-surface removal and solid modeling
- scientific article; zbMATH DE number 1911009 (Why is no real title available?)
- Conflict neutralization on binary space partitioning
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- Decomposing the complement of the union of cubes and boxes in three dimensions
- Linear size binary space partitions for fat objects
- Linear size binary space partitions for uncluttered scenes
- Approximate range searching using binary space partitions
- Binary space partition for orthogonal fat rectangles
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Eliminating depth cycles among triangles in three dimensions
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
This page was built for publication: Binary Space Partitions for Fat Rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943877)