Space-efficient planar convex hull algorithms

Theoretical Computer Science

Volumn 321, Issue 1, 2004, Pages 25-40

  Brönnimann, Hervé ^a   Iacono, John ^a   Katajainen, Jyrki ^b   Morin, Pat ^c   Morrison, Jason ^c   Toussaint, Godfried ^d  

^a CALIFORNIA STATE POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

^c CARLETON UNIVERSITY   (Canada)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Computational geometry; Convex hulls; In situ; In place

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

CONVEX HULL ALGORITHM; EUCLIDEAN PLANE; IN SITU; IN-PLACE;

COMPUTATIONAL GEOMETRY;

EID: 2442490630     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.05.004     Document Type: Conference Paper

References (41)

1. Andrew A.M. Another efficient algorithm for convex hulls in two dimensions. Inform. Process. Lett. 9:1979;216-219. corrigendum, Inform. Process. Lett. 10 (1980) 168.
2. Bhattacharya B.K., Sen S. On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm. J. Algorithms. 25(1):1997;177-193.
3. Chan T. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16:1996;361-368.
4. Chan T., Snoeyink J., Yap C.K. Primal dividing and dual pruning. output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams Discrete Comput. Geom. 18:1997;433-454.
5. Chan T.M. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geom. 16:1996;369-387.
6. Chazelle B., Dobkin D.P. Intersection of convex objects in 2 and 3 dimensions. J. ACM. 34:1987;1-27.
7. K.L. Clarkson, More output-sensitive geometric algorithms, in: Proc. 35th IEEE Symp. Foundations of Computer Science, 1994, pp. 695-702.
8. Clarkson K.L., Shor P.W. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(1):1988;387-421.
9. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, NJ.
10. Dijkstra E.W. Smoothsort, an alternative for sorting in situ. Sci. Comput. Programming. 1(3):1982;223-233.
11. Dijkstra E.W., van Gasteren A.J.M. An introduction to three algorithms for sorting in situ. Inform. Process. Lett. 15(3):1982;129-134.
12. Dvorak S., Durian B. Stable linear time sublinear space merging. Comput. J. 30(4):1987;372-375.
13. Dvorak S., Durian B. Unstable linear time O(1) space merging. Comput. J. 31(3):1988;279-282.
14. Eddy W. A new convex hull algorithm for planar sets. ACM Trans. Math. Software. 3(4):1977;398-403.
15. Floyd R.W. Algorithm 245, Treesort 3. Commun. ACM. 7:1964;401.
16. Graham R.L. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett. 1:1972;132-133.
17. Horowitz E., Sahni S., Rajasekaran S. Computer Algorithms. 1998;Computer Science Press, Rockville, MD.
18. Huang B.-C., Langston M.A. Practical in-place merging. Commun. ACM. 31(3):1988;348-352.
19. Huang B.-C., Langston M.A. Fast stable merging and sorting in constant extra space. Comput. J. 35(6):1992;643-650.
20. Jarvis A. On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett. 2:1973;18-21.
21. Katajainen J., Pasanen T. Stable minimum space partitioning in linear time. BIT. 32(4):1992;580-585.
22. Katajainen J., Pasanen T.A. In-place sorting with fewer moves. Inform. Process. Lett. 70(1):1999;31-37.
23. Katajainen J., Pasanen T., Teuhola J. Practical in-place mergesort. Nordic J. Comput. 3:1996;27-40.
24. Kirkpatrick D.G., Seidel R. The ultimate planar convex hull algorithm? SIAM J. Comput. 15(1):1986;287-299.
25. T.W. Lai, D. Wood, Implicit selection, in: Proc. 1st Scandinavian Workshop on Algorithm Theory, Vol. 318, Lecture Notes in Computer Science, Springer, Berlin, 1988, pp. 14-23.
26. Mannila H., Ukkonen E. A simple linear-time algorithm for in situ merging. Inform. Process. Lett. 18(4):1984;203-208.
27. Megiddo N. Linear programming in linear time when the dimension is fixed. J. ACM. 31(1):1984;114-127.
28. P. Morin, insitu.tgz, Available online at http://www.cs.carleton.ca/ ~morin/ (2002).
29. Munro J.I., Raman V., Salowe J.S. Stable in situ sorting and minimum data movement. BIT. 30(2):1990;220-234.
30. T. Ottman, S. Schuirer, S. Soundaralaksmij, Enumerating extreme points in higher dimensions, in: Proc. 12th Symp. Theoretical Aspects of Computer Science, Vol. 900, Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 562-570.
31. Overmars M.H., van Leeuwen J. Maintenance of configurations in the plane. J. Comput. System Sci. 23:1981;166-204.
32. Preparata F.P. An optimal real time algorithm for planar convex hulls. Commun. ACM. 22:1979;402-405.
33. Preparata F.P., Hong S.J. Convex hulls of finite point sets in two and three dimensions. Commun. ACM. 2(20):1977;87-93.
34. Preparata F.P., Shamos M.I. Computational Geometry. 1985;Springer, Berlin.
35. Salowe J., Steiger W. Simplified stable merging tasks. J. Algorithms. 8(4):1987;557-571.
36. Seidel R. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6:1991;423-434.
37. M.I. Shamos, Computational geometry, Ph.D. Thesis, Yale University, 1978.
38. Six H.W., Wegner L. Sorting a random access file in situ. Comput. J. 27(3):1984;270-275.
39. Symvonis A. Optimal stable merging. Comput. J. 38(8):1995;681-690.
40. Wenger R. Randomized quick hull. Algorithmica. 17:1997;322-329.
41. Williams J.W.J. Algorithm 232, Heapsort. Commun. ACM. 7:1964;347-348.