SEPARATING SETS OF HYPERRECTANGLES

DOI10.1142/S0218195993000105zbMATH Open0776.68107OpenAlexW2153905736MaRDI QIDQ3136722FDOQ3136722

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

Recommendations

• scientific article
• 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

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)

Cited In (5)

• Improved sublinear time algorithm for width-bounded separators
• Partitioning and separating sets of orthogonal polygons
• Title not available (Why is that?)
• On optimal cuts of hyperrectangles
• Title not available (Why is that?)

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)