Rectilinear line segment intersection, layered segment trees, and dynamization
From MaRDI portal
Publication:3939249
DOI10.1016/0196-6774(82)90016-5zbMath0481.68062OpenAlexW2077950479MaRDI QIDQ3939249
Vijay K. Vaishnavi, Derick Wood
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(82)90016-5
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)
Related Items (18)
Fractional cascading. I: A data structuring technique ⋮ Shortest paths among transient obstacles ⋮ A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency ⋮ General methods for 'all elements' and 'all pairs' problems ⋮ Dynamic fractional cascading ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ Polygonal intersection searching ⋮ On the equivalence of some rectangle problems ⋮ A worst-case efficient algorithm for hidden-line elimination† ⋮ External-memory algorithms for processing line segments in geographic information systems ⋮ On the optimal binary plane partition for sets of isothetic rectangles ⋮ An O(n log n) Manhattan path algorithm ⋮ Interval graphs and related topics ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects ⋮ Algorithms for bichromatic line-segment problems and polyhedral terrains ⋮ Fast dynamic intersection searching in a set of isothetic line segments ⋮ On some union and intersection problems for polygons with fixed orientations ⋮ The range co-minima problem
This page was built for publication: Rectilinear line segment intersection, layered segment trees, and dynamization
