Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 162-171

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

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

CONVEX HULL; EXTREME POINTS; LINEAR TIME; SPACE EFFICIENT ALGORITHMS;

ALGORITHMS;

EID: 35048875720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_20     Document Type: Article

References (12)

1. G. Aloupis. A History of Linear-time Convex Hull Algorithms for Simple Polygons. http://cgm.cs.mcgill.ca/~athens/cs601/
2. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, 1998.
3. H. Brönnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison, and G.T. Toussaint. Space-efficient planar convex hull algorithms. To appear in Theoretical Computer Science. Special issue of selected papers from Latin American Theoretical INformatics (LATIN 2002).
4. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. 2nd edition, MIT Press, 2001.
5. E. Y. Chen and T. M. Chan. A Space-Efficient Algorithm for Segment Intersection. In Proc. 15th Canadian Conference on Computational Geometry, pp. 68-71, 2003.
6. V. Geffert, J. Katajainen, and T. Fasanen. Asymptotically efficient in-place merging. Theoretical Computer Science 237:159-181, 2000.
7. J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT 32:580-585, 1992.
8. J. Katajainen and T. Pasanen. Sorting multiset stably in minimum space. Acta Informatica 31:410-421, 1994.
9. J. Katajainen, T. Pasanen and J. Teuhola. Practical in-place mergesort. Nordic Journal of Computing 3:27-40, 1996.
10. D.T. Lee. On finding the convex hull of a simple polygon. International Journal of Computing & Information Sciences 12(2):87-98, 1983.
11. A. Melkman. On-line construction of the convex hull of a simple polygon. Information Processing Letters 25:11-12, 1987.
12. J. I. Munro, V. Raman, and J. S. Salowe. Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234, 1990.