On optimal cuts of hyperrectangles

DOI10.1007/BF02238431zbMath0833.68066OpenAlexW1523915190MaRDI QIDQ1900692

Yanyan Li

Publication date: 18 March 1996

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238431

zbMATH Keywords

balanced cutsisothetic hyperrectangles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE ⋮ Computing the depth distribution of a set of boxes

Cites Work

• Perfect binary space partitions
• Efficient binary space partitions for hidden-surface removal and solid modeling
• On the optimal binary plane partition for sets of isothetic rectangles
• Ignoring ignorance and agreeing to disagree
• SEPARATING SETS OF HYPERRECTANGLES
• Optimal binary space partitions for orthogonal objects
• Multidimensional binary search trees used for associative searching
• On the complexity of computing the measure of ∪[a _i ,b _i ]

This page was built for publication: On optimal cuts of hyperrectangles