Hierarchical Space Decompositions for Low-Density Scenes
Publisher
Springer New York
Reference8 articles.
1. De Berg M (2000) Linear size binary space partitions for uncluttered scenes. Algorithmica 28(3):353–366
2. De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin/Heidelberg
3. De Berg M, Katz M, Van der Stappen AF, Vleugels J (2002) Realistic input models for geometric algorithms. Algorithmica 34(1):81–97
4. De Berg M, Haverkort H, Thite S, Toma L (2010) Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput Geom Theory Appl 43:493–513
5. Chazelle B (1984) Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J Comput 13(3):488–507