SEPARATING SETS OF HYPERRECTANGLES

DOI10.1142/S0218195993000105MaRDI QIDQ3136722zbMATHOpenAlexFDO

Authors Fabrizio d'Amore, Paolo G. Franciosa

Publication date 24 October 1993

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195993000105

zbMATH Keywords

rectanglesseparatorbinary space partitions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4213450
• On optimal cuts of hyperrectangles
• Separating collections of points in Euclidean spaces
• On the optimal binary plane partition for sets of isothetic rectangles
• Algorithms for ham-sandwich cuts

Cited in

(5)

• Partitioning and separating sets of orthogonal polygons
• scientific article; zbMATH DE number 759640 (Why is no real title available?)
• scientific article; zbMATH DE number 1760038 (Why is no real title available?)
• On optimal cuts of hyperrectangles
• Improved sublinear time algorithm for width-bounded separators

This page was built for publication: SEPARATING SETS OF HYPERRECTANGLES

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