Further results on generalized intersection searching problems: Counting, reporting, and dynamization

DOI10.1007/3-540-57155-8_262zbMath1504.68256OpenAlexW1488031319MaRDI QIDQ5060128

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

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_262

zbMATH Keywords

persistencedata structurescomputational geometryintersection searchingdynamization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

On intersection searching problems involving curved objects ⋮ Algorithms for generalized halfspace range searching and other intersection searching problems

Cites Work

• Efficient dynamic algorithms for some geometric intersection problems
• Making data structures persistent
• Connected component and simple polygon intersection searching
• Priority Search Trees
• Filtering Search: A New Approach to Query-Answering
• Adding range restriction capability to dynamic data structures
• GENERALIZED INTERSECTION SEARCHING PROBLEMS

This page was built for publication: Further results on generalized intersection searching problems: Counting, reporting, and dynamization