Hierarchical representations of collections of small rectangles

DOI10.1145/50020.50021MaRDI QIDQ3815520zbMATH OpenOpenAlexFDO

Authors Hanan Samet

Publication date 1988

Published in ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/50020.50021

zbMATH Keywords

CADcartographycomputational geometrygeographic information systemsgeometric algorithmshierarchical data structuresmultidimensional data structuresplane-sweeppriority search treesquadtreesR-treesrectangle intersection problemrepresentative pointssegment treessurveyVLSI design rule checking

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computing methodologies and applications (68U99)

Recommendations

• The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
• Computing rectangle enclosures
• Reporting Intersections of Polygons
• Hole Problems for Rectangles in the Plane
• Dynamic rectangular intersection with priorities

Cited in

(6)

• Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
• A generalized comparison of linear representations of thematic layers
• Incremental Pseudo Rectangular Organization of Information Relative to a Domain
• The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
• scientific article; zbMATH DE number 4044999 (Why is no real title available?)
• scientific article; zbMATH DE number 4085083 (Why is no real title available?)

This page was built for publication: Hierarchical representations of collections of small rectangles

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