EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

DOI10.1142/S0218195909003088zbMath1190.65028MaRDI QIDQ3405967

Ravi Janardan, Prosenjit Gupta, Michiel H. M. Smid

Publication date: 12 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

persistencepruningintersection problemgeometric dualitysparsificationgeometric searchingoutput-sensitive queryingquery objectgeneralized non-intersection problemgeometric querynon-intersection problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• A technique for adding range restrictions to generalized searching problems
• Efficient dynamic algorithms for some geometric intersection problems
• Partitioning arrangements of lines. II: Applications
• Making data structures persistent
• Separating convex sets in the plane
• Applications of a new space-partitioning technique
• Segment intersection searching problems in general settings
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Connected component and simple polygon intersection searching
• Priority Search Trees
• Filtering Search: A New Approach to Query-Answering
• Separating plane convex sets.
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS

This page was built for publication: EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA