Fast dynamic intersection searching in a set of isothetic line segments
From MaRDI portal
Publication:1065550
DOI10.1016/0020-0190(85)90054-7zbMath0577.68069MaRDI QIDQ1065550
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
computational geometry; segment tree; halfobject technique; line segment intersection searching; range tree
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68R99: Discrete mathematics in relation to computer science
Related Items
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