Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra

DOI10.1007/BF01840388zbMath0685.68078OpenAlexW2057267186MaRDI QIDQ1262147

Gabriele Blankenagel, Ralf Hartmut Gueting

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840388

zbMATH Keywords

computational geometrypoint locationdivide-and-conquerplanar subdivisionsplane-sweepgeometric databasegeorelational algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Artificial intelligence (68T99) Other problems of combinatorial convexity (52A37) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• A practical divide-and-conquer algorithm for the rectangle intersection problem
• Topologically sweeping an arrangement
• Organization and maintenance of large ordered indexes
• Finding Rectangle Intersections by Divide-and-Conquer
• A new approach to rectangle intersections
• Optimal Point Location in a Monotone Subdivision
• Searching and storing similar lists
• Divide-and-conquer in planar geometry
• A Note on Locating a Set of Points in a Planar Subdivision
• The measure problem for rectangular ranges in d-space
• Optimal Search in Planar Subdivisions