The complexity and construction of many faces in arrangements of lines and of segments
Open Access
- 1 March 1990
- journal article
- Published by Springer Science and Business Media LLC in Discrete & Computational Geometry
- Vol. 5 (2), 161-196
- https://doi.org/10.1007/bf02187784
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- Ray Tracing Algorithms — Theory and PracticePublished by Springer Science and Business Media LLC ,1988
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- On the maximal number of edges of many faces in an arrangementJournal of Combinatorial Theory, Series A, 1986
- The Signature of a Plane CurveSIAM Journal on Computing, 1986