On optimal cuts of hyperrectangles

DOI10.1007/BF02238431MaRDI QIDQ1900692zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

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

Cites work

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

Cited in

(8)

• Optimally cutting a surface into a disk
• Optimal cutting directions and rectangle orientation algorithm
• Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
• SEPARATING SETS OF HYPERRECTANGLES
• Optimal binary space partitions for segments in the plane
• On the relative strength of split, triangle and quadrilateral cuts
• scientific article; zbMATH DE number 637334 (Why is no real title available?)
• Computing the depth distribution of a set of boxes

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)