I/O-Efficient Dynamic Planar Point Location
Cached
Download Links
- [www.cs.duke.edu]
- [wwwmath.uni-muenster.de]
- DBLP
Other Repositories/Bibliography
by
Lars Arge
,
Jan Vahrenhold
| Citations: | 29 - 17 self |
BibTeX
@MISC{Arge_i/o-efficientdynamic,
author = {Lars Arge and Jan Vahrenhold},
title = {I/O-Efficient Dynamic Planar Point Location},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present the first provably I/O-efficient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N/B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in ... I/Os in the worst-case, and insertions and deletions can be performed in ... and ... I/Os amortized, respectively. Previously, an I/O-efficient dynamic point location structure was only known for monotone subdivisions. Part of our data structure...
