Binary space partition for orthogonal fat rectangles
From MaRDI portal
Publication:5897271
DOI10.1007/B13632zbMATH Open1266.68194OpenAlexW1827234103MaRDI QIDQ5897271FDOQ5897271
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Binary Space Partitions for Fat Rectangles
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- Optimal binary space partitions for orthogonal objects
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (10)
- Binary Space Partitions of Orthogonal Subdivisions
- Cuttings for disks and axis-aligned rectangles in three-space
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- Linear size binary space partitions for fat objects
- Exact size of binary space partitionings and improved rectangle tiling algorithms
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Optimal binary space partitions for orthogonal objects
- Binary Space Partitions for Fat Rectangles
This page was built for publication: Binary space partition for orthogonal fat rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897271)