Towards in-place geometric algorithms and data structures

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 239-246

  Brönnimann, Hervé ^a   Chan, Timothy M ^b   Chen, Eric Y ^b  

^a Polytechnic University   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Convex hulls; In place algorithms; Range searching; Voronoi diagrams

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBLEM SOLVING; RANDOM PROCESSES; TRIANGULATION;

CONVEX HULLS; IN-PLACE ALGORITHMS; RANGE SEARCHING; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 4544357053     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997854     Document Type: Conference Paper

References (32)

1. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformations. J. Algorithms, 1:301-358, 1980.
2. P. Bose, A. Maheshwari, P. Morin, J. Morrison, M. Smid, and J. Vahrenhold. Space-efficient geometric divide-and-conquer algorithms. In 20th European Workshop Comput. Geom., 2004, to appear.
3. H. Brönnimann and T. M. Chan. Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. In Proc. Latin American Theoretical Informatics, 2004, to appear.
4. H. Brönnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison, and G. T. Toussaint. Space-efficient planar convex hull algorithms. In Proc. Latin American Theoretical Informatics, pages 494-507, 2002; Theoret. Comput. Sci., to appear.
5. T. M. Chan. Closest-point problems simplified on the RAM. In Proc. 13rd ACM-SIAM Sympos. on Discrete Algorithms, pages 472-473, 2002.
6. T. M. Chan. A minimalist's implementation of the 3-d divide-and-conquer convex hull algorithm. Manuscript, http://www.cs.uwaterloo.ca/~tmchan/pub.html#ch3d, 2003.
7. T. M. Chan. An optimal randomized algorithm for maximum Tukey depth. In Proc. 15th ACM-SIAM Sympos. on Discrete Algorithms, pages 423-429, 2004.
8. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom., 16:361-368, 1996.
9. B. Chazelle, D. Liu, and A. Magen. Sublinear geometric algorithms. In Proc. 35th ACM Sympos. Theory Comput., pages 531-540, 2003.
10. B. Chazelle. Lower bounds for orthogonal range searching, I: The reporting case. J. ACM, 37:200-212, 1990.
11. E. Y. Chen and T. M. Chan. A space-efficient algorithm for segment intersection. In Proc. 15th Canad. Conf. Comput. Geom., pages 68-71, 2003.
12. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
13. M. Denny and C. Sohler. Encoding a triangulation as a permutation of its point set. In Proc. 9th Canad. Conf. Comput. Geom., pages 39-43, 1997.
14. S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
15. G. Franceschini and V. Geffert. An in-place sorting with O(n log n) comparisons and O(n) moves. In 44th IEEE Sympos. Found. of Comput. Sci., pages 242-250, 2003.
16. G. Franceschini and R. Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. In Proc. 14th ACM-SIAM Sympos. on Discrete Algorithms, pages 670-678, 2003.
17. G. Franceschini and R. Grossi. Optimal worst-case operations for implicit cache-oblivious search trees. In Proc. 8th Workshop on Algorithms Data Struct., Lect. Notes Comput. Sci., 2003.
18. G. Franceschini, R. Grossi, J. I. Munro, and L. Pagli. Implicit B-trees: New results for the dictionary problem. In Proc. 43rd IEEE Sympos. Found. of Comput. Sci., pages 145-154, 2002.
19. K. Hinrichs, J. Nievergelt, and P. Schorn. An all-round sweep algorithm for 2-dimensional nearest-neighbors problems. Acta Inform., 29(4):383-394, 1992.
20. C.-Y. Lo, J. Matoušek, and W. L. Steiger. Algorithms for ham-sandwich cuts. Discrete Comput. Geom., 11:433-452, 1994.
21. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
22. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
23. J. Matoušek and O. Schwarzkopf. Linear optimization queries. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 16-25, 1992.
24. J. Matoušek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10(2):215-232, 1993.
25. N. Megiddo. Partitioning with two lines in the plane. J. Algorithms, 6:430-433, 1985.
26. 2 n) time. J. Comput. Sys. Sci., 33:66-74, 1986.
27. S. Muthukrishnan. Data streams: Algorithms and applications. Manuscript, http://www.cs.rutgers.edu/~muthu, 2003.
28. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM, 20:87-93, 1977.
29. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
30. R. Seidel. Constructing higher-dimensional convex hulls at logarithmic cost per face. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 404-413, 1986.
31. J. Snoeyink and M. van Kreveld. Linear-time reconstruction of Delaunay triangulations with applications. In Proc. Annu. European Sympos. Algorithms, number 1284 in Lecture Notes Comput. Sci., pages 459-471. Springer-Verlag, 1997.
32. D. E. Willard. Polygon retrieval. SIAM J. Comput., 11:149-165, 1982.