On optimal cuts of hyperrectangles

DOI10.1007/BF02238431zbMATH Open0833.68066OpenAlexW1523915190MaRDI QIDQ1900692FDOQ1900692

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

Recommendations

• SEPARATING SETS OF HYPERRECTANGLES
• A fast algorithm for cutting a rectangle into equal rectangular pieces
• scientific article
• On the optimal binary plane partition for sets of isothetic rectangles
• Cutting hyperplanes for divide-and-conquer

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Optimally cutting a surface into a disk
• Optimal cutting directions and rectangle orientation algorithm
• On the relative strength of split, triangle and quadrilateral cuts
• SEPARATING SETS OF HYPERRECTANGLES
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Computing the depth distribution of a set of boxes
• Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900692)