Parallel Dynamic Spatial Indexes
Open Access
- 28 January 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 150-163
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (National Science Foundation) (CCF-2238358)
- NSF (National Science Foundation) (CCF-2339310)
- NSF (National Science Foundation) (IIS-2227669)
- NSF (National Science Foundation) (TI-2346223)
This publication has 43 references indexed in Scilit:
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problemComputers & Operations Research, 2023
- Incremental BVH construction for ray tracingComputers & Graphics, 2015
- Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenesComputers & Graphics, 2008
- Efficient Bulk Operations on Dynamic R-TreesAlgorithmica, 2002
- Thread Scheduling for Multiprogrammed MultiprocessorsTheory of Computing Systems, 2001
- A Design of Parallel R-tree on Cluster of Workstations2000
- New linear node splitting algorithm for R-trees1997
- The R-link tree: A recoverable index structure for spatial data1994
- Oct-trees and their use in representing three-dimensional objectsComputer Graphics and Image Processing, 1980
- Decomposable searching problemsInformation Processing Letters, 1979