On the optimal binary plane partition for sets of isothetic rectangles

DOI10.1016/0020-0190(92)90210-MzbMATH Open0795.68189OpenAlexW1994432275WikidataQ128017954 ScholiaQ128017954MaRDI QIDQ1209352FDOQ1209352

Authors Fabrizio d'Amore, Paolo G. Franciosa 

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)

Recommendations

• Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
• Binary plane partitions for disjoint line segments
• Optimal binary space partitions in the plane
• Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
• Perfect binary space partitions

Cites work

• scientific article; zbMATH DE number 432755 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Priority Search Trees
• Rectilinear line segment intersection, layered segment trees, and dynamization

Cited in

(14)

• The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
• Drawing slicing graphs with face areas
• New results on binary space partitions in the plane (extended abstract)
• New results on binary space partitions in the plane
• Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
• On communication protocols that compute almost privately
• SEPARATING SETS OF HYPERRECTANGLES
• On optimal cuts of hyperrectangles
• On rectilinear duals for vertex-weighted plane graphs
• Optimal binary space partitions for segments in the plane
• The structure of rectangle families dividing the plane into maximum number of atoms
• Optimal BSPs and rectilinear cartograms
• The structure of optimal partitions of orthogonal polygons into fat rectangles
• Spanning trees crossing few barriers

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

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