Space-efficient geometric divide-and-conquer algorithms

Computational Geometry: Theory and Applications

Volumn 37, Issue 3 SPEC. ISS., 2007, Pages 209-227

  Bose, Prosenjit ^a   Maheshwari, Anil ^a   Morin, Pat ^a   Morrison, Jason ^a   Smid, Michiel ^a   Vahrenhold, Jan ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

In situ algorithms; In place algorithms; Space efficient algorithms

Indexed keywords

APPLICATIONS; COMPUTATIONAL GEOMETRY;

CLOSEST PAIR PROBLEM; DETERMINISTIC ALGORITHMS; DIVIDE-AND-CONQUER ALGORITHM; GEOMETRIC PROBLEMS; IN-PLACE ALGORITHMS; LINE SEGMENT INTERSECTION; RANDOMIZED SOLUTIONS; SPACE EFFICIENT ALGORITHMS;

PROBLEM SOLVING;

EID: 34247505675     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.03.006     Document Type: Conference Paper

References (15)

1. J.L. Bentley, and M.I. Shamos Divide-and-conquer in multidimensional space Proceedings of the Eighth Annual ACM Symposium on the Theory of Computation 1976 Association for Computing Machinery 220 230
2. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan Time bounds for selection Journal of Computer and System Sciences 7 4 August 1973 448 461
3. H. Brönnimann, and M.-Y. Chan Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time Proceedings of Latin American Theoretical Informatics (LATIN'04) Lecture Notes in Computer Science vol. 2976 2004 Springer Berlin 162 171
4. H. Brönnimann, T.M.-Y. Chan, E. Chen, Towards in-place geometric algorithms and data structures, in: Proceedings of the Twentieth ACM Symposium on Computational Geometry, 2004, pp. 239-246
5. H. Brönnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison, and G.T. Toussaint Optimal in-place planar convex hull algorithms S. Rajsbaum, Proceedings of Latin American Theoretical Informatics (LATIN 2002) Lecture Notes in Computer Science vol. 2286 2002 Springer Berlin 494 507
6. E.Y. Chen, T.M.-Y. Chan, A space-efficient algorithm for line segment intersection, in: Proceedings of the 15th Canadian Conference on Computational Geometry, 2003, pp. 68-71
7. K.L. Clarkson, and P.W. Shor Applications of random sampling in computational geometry II Discrete Computational Geometry 4 1989 387 421
8. T. Cormen, C. Leiserson, R. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 McGraw-Hill
9. V. Geffert, J. Katajainen, and T. Pasanen Asymptotically efficient in-place merging Theoretical Computer Science 237 1-2 April 2000 159 181
10. M.T. Goodrich, J.-J. Tsay, D.E. Vengroff, J.S. Vitter, External-memory computational geometry, in: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 714-723
11. C.A.R. Hoare Algorithm 63 (PARTITION) and algorithm 65 (FIND) Communications of the ACM 4 7 1961 321 322
12. J. Katajainen, and T. Pasanen Stable minimum space partitioning in linear time BIT 32 1992 580 585
13. J. Katajainen, and T. Pasanen Sorting multisets stably in minimum space Acta Informatica 31 4 1994 301 313
14. D.E. Knuth The Art of Computer Programming: Fundamental Algorithms, vol. 1 second ed. 1997 Addison-Wesley
15. F.P. Preparata, and M.I. Shamos Computational Geometry. An Introduction second ed. 1988 Springer Berlin