Dynamic partition trees
From MaRDI portal
Publication:5056121
DOI10.1007/3-540-52846-6_108zbMath1502.68342OpenAlexW1916910483MaRDI QIDQ5056121
Haijo Schipper, Mark H. Overmars
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_108
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Storing line segments in partition trees
- \(\epsilon\)-nets and simplex range queries
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Decomposable searching problems
- An improved technique for output-sensitive hidden surface removal
- Priority Search Trees
- Partitioning with two lines in the plane
- Polygon Retrieval
- A simple output-sensitive algorithm for hidden surface removal