Abstract
Given an arrangement of n not all coincident lines in the Euclidean plane we show that there can be no more than \(\lfloor 4n/3\rfloor\) wedges (i.e. two-edged faces) and give explicit examples to show that this bound is tight. We describe the connection this problem has to the problem of obtaining lower bounds on the number of ordinary points in arrangements of not all coincident, not all parallel lines, and show that there must be at least \(\lfloor(5{\it n} + 6)/39\rfloor\) such points.
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
Borwein, P., Moser, W.: A survey of Sylvester’s problem and its generalizations. Aequationes Mathematicae 40, 111–135 (1990)
Ching, Y.T., Lee, D.T.: Finding the diameter of a set of lines. Pattern Recognition 18, 249–255 (1985)
Csima, J., Sawyer, E.: There exist 6n/13 ordinary points. Discrete and Computational Geometry 9, 187–202 (1993)
Devillers, O., Mukhopadhyay, A.: Finding an ordinary conic and an ordinary hyperplane. Nordic Journal of Computing 6, 462–468 (1999)
Devroye, L., Toussaint, G.: Convex hulls for random lines. Journal of Algorithms 14, 381–394 (1993)
Felsner, S.: Geometric Graphs and Arrangements. Vieweg and Sohn, Wiesbaden, Germany (2004)
Golin, M., Langerman, S., Steiger, W.: The convex hull for random lines in the plane. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 172–175. Springer, Heidelberg (2003)
Keil, M.: A simple algorithm for determining the envelope of a set of lines. Information Processing Letters 39, 121–124 (1991)
Kelly, L., Moser, W.: On the number of ordinary lines determined by n points. Canadian Journal of Mathematics 10, 210–219 (1958)
Lenchner, J.: On the dual and sharpened dual of Sylvester’s theorem in the plane. IBM Research Report, RC23411, W0409-066 (2004)
Melchior, E.: Über vielseite der projektiven eberne. Deutsche Math. 5, 461–475 (1940)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenchner, J. (2005). Wedges in Euclidean Arrangements. In: Akiyama, J., Kano, M., Tan, X. (eds) Discrete and Computational Geometry. JCDCG 2004. Lecture Notes in Computer Science, vol 3742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589440_14
Download citation
DOI: https://doi.org/10.1007/11589440_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30467-8
Online ISBN: 978-3-540-32089-0
eBook Packages: Computer ScienceComputer Science (R0)