External Memory Planar Point Location with Logarithmic Updates-Reference-Cited by-同舟云学术

External Memory Planar Point Location with Logarithmic Updates

Published:2011-06-15 Issue:1-2 Volume:63 Page:457-475
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Arge Lars,Brodal Gerth Stølting,Rao S. Srinivasa

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-011-9541-2.pdf

Reference24 articles.

1. Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I/O-efficient dynamic point location in monotone planar subdivisions. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 1116–1127 (1999)

2. Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)

3. Arge, L., Brodal, G.S., Georgiadis, L.: Improved dynamic planar point location. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 305–314 (2006)

4. Arge, L., Brodal, G.S., Rao, S. Srinivasa: External memory planar point location with logarithmic updates. In: Proc. ACM Symposium on Computational Geometry, pp. 139–147 (2008)

5. Arge, L., Danner, A., Teh, S.-H.: I/O-efficient point location using persistent B-trees. ACM J. Exp. Algorithms 8 (2003)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. External Memory Fully Persistent Search Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Building an Optimal Point-Location Structure in $$O( sort (n))$$ O ( s o r t ( n ) ) I/Os;Algorithmica;2018-09-28