Efficient dynamic algorithms for some geometric intersection problems

DOI10.1016/0020-0190(90)90151-MzbMath0706.68054MaRDI QIDQ918702

Ravi Janardan, Siu-Wing Cheng

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityanalysis of algorithmsdata structuresdesign of algorithmscomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Further results on generalized intersection searching problems: Counting, reporting, and dynamization ⋮ INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS ⋮ EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Priority Search Trees
• Filtering Search: A New Approach to Query-Answering
• Adding range restriction capability to dynamic data structures
• Dynamic orthogonal segment intersection search
• Rectilinear line segment intersection, layered segment trees, and dynamization
• Binary Search Trees of Bounded Balance

This page was built for publication: Efficient dynamic algorithms for some geometric intersection problems