Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes-Reference-Cited by-同舟云学术

Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes

Published:2005 Issue: Volume: Page:269-281
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alexandron Giora,Kaplan Haim,Sharir Micha

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11534273_24.pdf

Reference8 articles.

1. Agarwal, P.K., Guibas, L., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 353–374 (2001)

2. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–28 (1999)

3. Chan, T.M.: On levels in arrangements of curves, II: A simple inequality and its consequences. In: Proc. 44th IEEE Sympos. Foundat. Comput. Sci., pp. 544–550 (2003)

4. Dey, T.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373–382 (1998)

5. Guibas, L.: Kinetic data structures: a state of the art report. In: Robotics: the Algorithmic Perspective (WAFR 1998), pp. 191–209. A.K. Peters, Natick (1998)

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

1. An experimental analysis of self-adjusting computation;ACM Transactions on Programming Languages and Systems;2009-10

2. Self-adjusting Computation with Delta ML;Advanced Functional Programming;2009

3. Kinetic Algorithms Via Self-adjusting Computation;Lecture Notes in Computer Science;2006

4. Out-of-Order Event Processing in Kinetic Data Structures;Lecture Notes in Computer Science;2006