Abstract
We present space-efficient algorithms for computing the convex hull of a simple polygonal line in-place, in linear time. It turns out that the problem is as hard as stable partition, i.e., if there were a truly simple solution then stable partition would also have a truly simple solution, and vice versa. Nevertheless, we present a simple self-contained solution that uses O(log n) space, and indicate how to improve it to O(1) space with the same techniques used for stable partition. If the points inside the convex hull can be discarded, then there is a truly simple solution that uses a single call to stable partition, and even that call can be spared if only extreme points are desired (and not their order). If the polygonal line is closed, then the problem admits a very simple solution which does not call for stable partitioning at all.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aloupis, G.: A History of Linear-time Convex Hull Algorithms for Simple Polygons, http://cgm.cs.mcgill.ca/~athens/cs601/
Boissonnat, J.-D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, Cambridge (1998)
Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Space-efficient planar convex hull algorithms. To appear in Theoretical Computer Science (2002); Special issue of selected papers from Rajsbaum, S. (ed.): LATIN 2002. LNCS, vol. 2286. Springer, Heidelberg (2002)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Chen, E.Y., Chan, T.M.: A Space-Efficient Algorithm for Segment Intersection. In: Proc. 15th Canadian Conference on Computational Geometry, pp. 68–71 (2003)
Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoretical Computer Science 237, 159–181 (2000)
Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT 32, 580–585 (1992)
Katajainen, J., Pasanen, T.: Sorting multiset stably in minimum space. Acta Informatica 31, 410–421 (1994)
Katajainen, J., Pasanen, T., Teuhola, J.: Practical in-place mergesort. Nordic Journal of Computing 3, 27–40 (1996)
Lee, D.T.: On finding the convex hull of a simple polygon. International Journal of Computing & Information Sciences 12(2), 87–98 (1983)
Melkman, A.: On-line construction of the convex hull of a simple polygon. Information Processing Letters 25, 11–12 (1987)
Munro, J.I., Raman, V., Salowe, J.S.: Stable in Situ Sorting and Minimum Data Movement. BIT 30(2), 220–234 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brönnimann, H., Chan, T.M. (2004). Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive