Searching for authors named "Jan Vahrenhold" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
In-Place Randomized Slope Selection
- …In-Place Randomized Slope Selection Henrik Blunck and Jan Vahrenhold Westfälische Wilhelms…
- Add To MetaCart
-
In-place algorithms for computing (layers of) maxima
- …In-Place Algorithms for Computing (Layers of) Maxima Henrik Blunck and Jan Vahrenhold Westfälische…
- Cited by 1 (1 self) – Add To MetaCart
-
I/O-Efficient Dynamic Planar Point Location
- …I/O-Ecient Dynamic Planar Point Location Lars Arge y Jan Vahrenhold z Department of Computer…
- Cited by 27 (16 self) – Add To MetaCart
-
Planar Point Location For Large Data Sets: To Seek Or Not To Seek
- …Planar Point Location For Large Data Sets: To Seek Or Not To Seek Jan Vahrenhold and Klaus H…
- Cited by 6 (1 self) – Add To MetaCart
-
Time Responsive Indexing Schemes for Moving Points
- …Time Responsive Indexing Schemes for Moving Points Pankaj K. Agarwal Lars Arge y Jan…
- Cited by 6 (3 self) – Add To MetaCart
-
Fast and simple external-memory planar point-location
- …Fast and Simple External-Memory Planar Point-Location (abstract) Jan Vahrenhold Klaus H. Hinrichs…
- Cited by 4 (2 self) – Add To MetaCart
-
Time Responsive External Data Structures for Moving Points
- …⋆ ⋆ ⋆ , and Jan Vahrenhold 1 Center for Geometric Computing, Department of Computer Science, Duke University…
- Cited by 3 (3 self) – Add To MetaCart
-
Efficient Bulk Operations on Dynamic R-trees (Extended Abstract)
- …2, Jan Vahrenhold2??, and Jeffrey S. Vitter1? ? ? 1 Center for Geometric Computing, Department…
- Add To MetaCart
-
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
- … Becker, Andre Giesen, Klaus H. Hinrichs, and Jan Vahrenhold FB 15, Mathematik und Informatik…
- Cited by 4 (0 self) – Add To MetaCart
-
I/O-Efficient Dynamic Planar Point Location (Extended Abstract)
- …I/O-Efficient Dynamic Planar Point Location (Extended Abstract) Lars Arge Jan Vahrenhold y…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
