Efficient non-intersection queries on aggregated geometric data

DOI10.1142/S0218195909003088MaRDI QIDQ3405967zbMATH OpenFDO

Authors Prosenjit Gupta, Ravi Janardan, Michiel Smid

Publication date 12 February 2010

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

Full work available at URL https://doi.org/10.1142/S0218195909003088

zbMATH Keywords

generalized non-intersection problemgeometric dualitygeometric querygeometric searchingintersection problemnon-intersection problemoutput-sensitive queryingpersistencepruningquery objectsparsification

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Range-aggregate query problems involving geometric aggregation operations
• Further results on generalized intersection searching problems: Counting, reporting, and dynamization

Cites work

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

Cited in

(2)

• An efficient method to evaluate intersections on big data sets
• Computing and Combinatorics

This page was built for publication: Efficient non-intersection queries on aggregated geometric data

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