Abstract:
Problems involving massive amounts of geometric data occur for example in spatial databases, geographic information systems (GIS), virtual reality systems, and computer graphics. If we want to solve these problems efficiently, we need
Citations
|
245
|
Algorithms for parallel memory I: Two-level memories. Algorithmica
– Vitter, Shriver
- 1994
|
|
124
|
External-memory computational geometry
– Goodrich, Tsay, et al.
- 1993
|
|
87
|
Optimal dynamic interval management in external memory
– Arge, Vitter
- 1996
|
|
80
|
The P-range tree: A new data structure for range searching in secondary memory
– Subramanian, Ramaswamy
- 1995
|
|
79
|
External-memory algorithms for processing line segments in geographic information systems
– Arge, Vengroff, et al.
- 1995
|
|
66
|
Path caching: A technique for optimal external searching
– Ramaswamy, Subramanian
- 1994
|
|
65
|
I/O Optimal Isosurface Extraction
– Chiang, Silva
- 1997
|
|
61
|
External memory algorithms
– VITTER
- 1998
|
|
34
|
Efficient 3-d range searching in external memory
– Vengroff, Vitter
- 1996
|
|
21
|
Dynamic and I/O-efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results
– Chiang
- 1995
|
|
15
|
I/O-efficient dynamic point location in monotone planar subdivisions
– Agarwal, Arge, et al.
- 1999
|
|
15
|
On showing lower bounds for external-memory computational geometry problems
– Arge, Miltersen
- 1999
|
|
5
|
External memory algorithms with dynamically changing memory allocations: Long version
– Barve, Vitter
- 1998
|
|
4
|
Fast and simple external-memory planar point-location
– Vahrenhold, Hinrichs
- 1997
|
|
1
|
Efficient External-Memory Data Stuctures and Applications
– Arge
- 1996
|
|
1
|
Optimal planar range searching in external memory
– Arge, Vitter
- 1999
|
|
1
|
The Theory and Practise of I/O-Efficient Computation
– Vengroff
- 1997
|
|
