Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
From MaRDI portal
Publication:1860195
DOI10.1016/S0031-3203(01)00202-3zbMath1006.68897WikidataQ60328079 ScholiaQ60328079MaRDI QIDQ1860195
Sridhar Radhakrishnan, B. John Oommen, Gopal Racherla
Publication date: 20 February 2003
Published in: Pattern Recognition (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic fractional cascading
- Fractional cascading. I: A data structuring technique
- An efficient algorithm for guard placement in polygons with holes
- Union-copy structures and dynamic segment trees
- Visibility of a simple polygon
- New Data Structures for Orthogonal Range Queries
- Rectilinear line segment intersection, layered segment trees, and dynamization
- The measure problem for rectangular ranges in d-space
- DYNAMIC PROGRAMMING ON INTERVALS
- Numerical similarity and dissimilarity measures between two trees
- Fractional cascading simplified