Tight bounds for dynamic convex hull queries (again)

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 354-363

  Demaine, Erik D ^a   Patrascu, Mihai ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bounded precision; Dynamic convex hull; Word RAM

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; PROBLEM SOLVING;

BOUNDED PRECISION; DYNAMIC CONVEX HULL; WORD RAM;

QUERY LANGUAGES;

EID: 35348877292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247131     Document Type: Conference Paper

References (28)

1. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 534-544, 1998.
2. L. Arge and J. S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32(6):1488-1508, 2003.
3. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proceedings of the 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 152-164, Rome, Italy, September 2002.
4. J. L. Bentley and J. B. Saxe. Decomposable searching problems i: Static-to-dynamic transformation. Journal of Algorithms, 1(4):301-358, 1980.
5. G. S. Brodai and R. Jacob. Dynamic planar convex hull with optimal query time and O (log n · log log n) update time. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 57-70, 2000.
6. G. S. Brodai and R. Jacob. Dynamic planar convex hull. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, November 2002.
7. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Efficient exact geometric computation made easy. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 341-350, Miami Beach, Florida, 1999.
8. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 92-99, 1999.
9. T. M. Chan. Point location in o(log n) time, Voronoi diagrams in o(n log n) time, and other transdichotomous results in computational geometry. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 333-342, Berkeley, California, October 2006.
10. o(√lg lg n) time. In Proceedings of the 39th ACM Symposium on Theory of Computing, San Diego, California, June 2007.
11. M. de Berg, M. van Kreveld, and J. Snoeyink. Two-and three-dimensional point location in rectangular subdivisions. Journal of Algorithms, 18(2):256-277, 1995.
12. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 365-372, New York City, May 1987.
13. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, 1989.
14. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
15. L. J. Guibas and D. H. Marimont. Rounding arrangements dynamically. International Journal of Computatinal Geometry and Applications, 8(2):157-176, 1998.
16. Y. Han and M. Thorup. Integer sorting in O(n√log log n) expected time and linear space. In Proceedings of the 43rd Symposium on Foundations of Computer Science, pages 135-144, Vancouver, Canada, November 2002.
17. R. Jacob. Dynamic Planar Convex Hull. PhD thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark, February 2002.
18. V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap. A core library for robust numeric and geometric computation. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 351-359, Miami Beach, Florida, 1999.
19. K. Mehlhorn and S. Schirra. Exact computation with leda.real - theory and geometric applications. In Symbolic Algebraic Methods and Verification Methods, pages 163-172. Springer, January 2001.
20. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing, 2:33-43, 1973.
21. M. H. Overmars. Computational geometry on a grid: an overview. In Theoretical Foundations for Computer Graphics and CAD, pages 167-184. Springer-Verlag, 1988.
22. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23(2):166-204, 1981.
23. E. Packer. Iterated snap rounding with bounded drift. In Proceedings of the 22nd Annual Symposium on Computational Geometry, pages 367-376, Sedona, Arizona, 2006.
24. M. Pǎtraşcu. Planar point location in sublogarithmic time. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 325-332, Berkeley, California, October 2006.
25. J. R. Shewchuk. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry: Towards Geometric Engineering, volume 1148 of Lecture Notes in Computer Science, pages 203-222. Springer-Verlag, May 1996.
26. A. M. Turing. On computable numbers with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42:230-265, August 1936.
27. A. C. C. Yao. Should tables be sorted? Journal of the Association for Computing Machinery, 28(3):615-628, 1981.
28. C. Yap. Theory of real computation according to EGC. In Proceedings of the Dagstuhl Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice, Lecture Notes in Computer Science, 2006. To appear. http://www.cs.nyu.edu/exact/doc/realtheory.pdf.