Abstract
An arrangement of n lines chosen at random from R 2 has a vertex set whose convex hull has constant (expected) size.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atallah, M.: Computing the Convex Hull of Line Intersections. J. Algorithms 7, 285–288 (1986)
Battacharya, B., Everett, H., Toussaint, G.: A Counter-Example to a Dynamic Algorithm for Convex Hulls of Line Arrangements. Pattern Rec. Letters 12, 145–147 (1991)
Boreddy, J.: An Incremental Computation of Convex Hull of Planar Line Intersections. Pattern Rec. Letters 11, 541–543 (1990)
Devroye, L., Toussaint, G.: Convex Hulls for Random Lines. J. Algorithms 14, 381–394 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golin, M., Langerman, S., Steiger, W. (2003). The Convex Hull for Random Lines in the Plane. In: Akiyama, J., Kano, M. (eds) Discrete and Computational Geometry. JCDCG 2002. Lecture Notes in Computer Science, vol 2866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44400-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-44400-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20776-4
Online ISBN: 978-3-540-44400-8
eBook Packages: Springer Book Archive