dc.contributor.author | Agarwal, Pankaj K. | |
dc.contributor.author | Arge, Lars | |
dc.contributor.author | Brodal, Gerth Stølting | |
dc.contributor.author | Vitter, Jeffrey Scott | |
dc.date.accessioned | 2011-03-16T15:17:08Z | |
dc.date.available | 2011-03-16T15:17:08Z | |
dc.date.issued | 1999 | |
dc.identifier.citation | P. K. Agarwal, L. Arge, G. Brodal, and J. S. Vitter. “I/O-Efficient Dynamic Point Location in Monotone Subdivisions,” Proceedings of the 10th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA ’99), Baltimore, MD, January 1999, 11–20. http://doi.acm.org/10.1145/314500.314525 | |
dc.identifier.uri | http://hdl.handle.net/1808/7168 | |
dc.description.abstract | We present an efficient external-memory dynamic data structure for point location in monotone planar subdivisions. Our data structure uses O(N/B) disk blocks to store a monotone subdivision of size N, where B is the size of a disk block. It supports queries in O(logi N) I/OS (worst-case) and updates
in O(lo& N) I/OS (amortized). We also propose a new variant of B-trees, called leuelbalanced
B-trees, which allow insert, delete, merge, and split
operations in O((l+ $ logM,B f) log, N) I/OS (amortized), 2 5 b 2 B/2, even if each node stores a pointer to its parent. Here M is the size of main memory. Besides being essential to our point-location data structure, we believe that
level-balanced B-trees are of significant independent interest. They can, for example, be used to dynamically maintain a planar St-graph using O((1 + $10g~,~ $$) log, N) = O(logi N) I/OS (amortized) per update, so that reachability queries can be answered in O(log, N) I/OS (worst case). | |
dc.language.iso | en_US | |
dc.publisher | Society for Industrial and Applied Mathematics | |
dc.title | I/O-efficient dynamic point location in monotone planar subdivisions | |
dc.type | Article | |
kusw.kuauthor | Vitter, Jeffrey Scott | |
kusw.oastatus | fullparticipation | |
dc.identifier.doi | 10.1145/314500.314525 | |
kusw.oaversion | Scholarly/refereed, publisher version | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess | |