On the optimal binary plane partition for sets of isothetic rectangles

DOI10.1016/0020-0190(92)90210-MzbMath0795.68189OpenAlexW1994432275WikidataQ128017954 ScholiaQ128017954MaRDI QIDQ1209352

Paolo Giulio Franciosa, Fabrizio d'Amore

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90210-m

zbMATH Keywords

computational geometryisothetic rectanglesbinary space partition algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

New results on binary space partitions in the plane (extended abstract) ⋮ OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE ⋮ On optimal cuts of hyperrectangles ⋮ New results on binary space partitions in the plane ⋮ Spanning trees crossing few barriers ⋮ OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS ⋮ On communication protocols that compute almost privately ⋮ Drawing slicing graphs with face areas ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ Binary space partitions for axis-parallel line segments: Size-height tradeoffs.

Cites Work

• Unnamed Item
• Unnamed Item
• Priority Search Trees
• Rectilinear line segment intersection, layered segment trees, and dynamization

This page was built for publication: On the optimal binary plane partition for sets of isothetic rectangles