The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees

DOI10.1016/0196-6774(86)90036-2MaRDI QIDQ3731037zbMATH OpenOpenAlexFDO

Authors Marinus Veldhorst

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90036-2

zbMATH Keywords

Partitions of the planepolynomial time algorithmsrecursive iso-oriented partitionssearch tree data structure

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the optimal binary plane partition for sets of isothetic rectangles
• Hierarchical representations of collections of small rectangles
• An optimal contour algorithm for iso-oriented rectangles
• An optimal time and minimal space algorithm for rectangle intersection problems
• Priority Search Trees

Cited in

(4)

• Representations of graphs and networks (coding, layouts and embeddings)
• Hierarchical representations of collections of small rectangles
• An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection
• scientific article; zbMATH DE number 844678 (Why is no real title available?)

This page was built for publication: The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees

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