On the optimal binary plane partition for sets of isothetic rectangles
From MaRDI portal
Publication:1209352
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
Recommendations
Cites Work
Cited In (14)
- On rectilinear duals for vertex-weighted plane graphs
- The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
- On communication protocols that compute almost privately
- Optimal BSPs and rectilinear cartograms
- New results on binary space partitions in the plane
- Spanning trees crossing few barriers
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- SEPARATING SETS OF HYPERRECTANGLES
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Drawing slicing graphs with face areas
- New results on binary space partitions in the plane (extended abstract)
- On optimal cuts of hyperrectangles
- The structure of rectangle families dividing the plane into maximum number of atoms
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)