Abstract
We are given n points in the plane and a vertical line ℓ (directed upwards) that intersects the convex hull, convS, of S. We want to find ‘ways’ to the first edge (facet) of convS met by line ℓ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
K.L. Clarkson, A Las Vegas algorithm for linear and integer programming when the dimension is small. J. Assoc. Comput. Mach. 42 (1995) 488–499.
M.E. Dyer, Linear algorithms for two and three-variable linear programs. SIAM J. Comput. 13 (1984) 31–45.
B. Gärtner, J. Solymosi, F. Tschirschnitz, P. Valtr and E. Welzl, Random edge pivots on d-polytopes with d + 2 facets, in preparation.
B. Gärtner and E. Welzl, Random sampling in geometric optimization: New insights and applications, Proc. 16th Annual ACM Symposium on Computational Geometry(2000)91–99.
N. Megiddo, Linear time algorithms for linear time programming in R3 and related problems, SIAM J. Comput. 12 (1983) 759–776.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Welzl, E. (2000). n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture). In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-40064-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41183-3
Online ISBN: 978-3-540-40064-6
eBook Packages: Springer Book Archive