Fast dynamic intersection searching in a set of isothetic line segments

DOI10.1016/0020-0190(85)90054-7zbMath0577.68069OpenAlexW2057377210MaRDI QIDQ1065550

Ralf Hartmut Gueting

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90054-7

zbMATH Keywords

computational geometrysegment treehalfobject techniqueline segment intersection searchingrange tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Dynamic fractional cascading

Cites Work

• Unnamed Item
• Decomposable searching problems
• Optimal algorithms to compute the closure of a set of iso-rectangles
• A new approach to rectangle intersections part I
• Priority Search Trees
• Some methods of computational geometry applied to computer graphics
• Counting and Reporting Intersections of d-Ranges
• Rectilinear line segment intersection, layered segment trees, and dynamization

This page was built for publication: Fast dynamic intersection searching in a set of isothetic line segments