Abstract
LetG={l 1,...,l n } be a collection ofn segments in the plane, none of which is vertical. Viewing them as the graphs of partially defined linear functions ofx, letY G be their lower envelope (i.e., pointwise minimum).Y G is a piecewise linear function, whose graph consists of subsegments of the segmentsl i . Hart and Sharir [7] have shown thatY G consists of at mostO(nα(n)) segments (whereα(n) is the extremely slowly growing inverse Ackermann's function). We present here a construction of a setG ofn segments for whichY G consists ofΩ(nα(n)) subsegments, proving that the Hart-Sharir bound is tight in the worst case.
Another interpretation of our result is in terms of Davenport-Schinzel sequences: the sequenceE G of indices of segments inG in the order in which they appear alongY G is a Davenport-Schinzel sequence of order 3, i.e., no two adjacent elements ofE G are equal andE G contains no subsequence of the forma ...b ...a ...b ...a. Hart and Sharir have shown that the maximal length of such a sequence composed ofn symbols is Θ(nα(n)). Our result shows that the lower bound construction of Hart and Sharir can be realized by the lower envelope ofn straight segments, thus settling one of the main open problems in this area.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
W. Ackermann, Zum Hilbertschen Aufbau der reellen Zahlen,Math. Ann 99 (1928), 118–133.
M. Atallah, Dynamic computational geometry,Proceedings of the 24th Symposium on Foundations of Computer Science, 92–99, 1983. (Also inComput. Math. Appl. 11 (1985), 1171–1181.)
A. Baltsan and M. Sharir, On Shortest Paths Between Two Convex Polyhedra, Technical Report No. 180, Computer Science Department, New York University, 1985. (To appear inJ. Assoc. Comput. Mach.)
R. Cole and M. Sharir, Visibility of a Polyhedral Surface from a Point, Technical Report No. 266, Computer Science Department, New York University, 1986. (To appear inJ. Symbolic Comput.)
H. Davenport, A combinatorial problem connected with differential equations, II,Acta Arith. 17 (1971), 363–372.
H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations,Amer. J. Math. 87 (1965), 684–694.
S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes,Combinatorica 6 (1986), 151–177.
P. Komjath, private communication.
D. Leven and M. Sharir, On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space, Technical Report No. 187, Computer Science Department, New York University, 1985. (Also inDiscrete Comput. Geom. 2 (1987), 255–270.)
C. Ó'Dúnlaing, M. Sharir, and C. K. Yap, Generalized Voronoi diagrams for a ladder, II: Efficient construction of the diagram,Algorithmica 2 (1987), 27–59.
R. Pollack, M. Sharir, and S. Sifrony, Separating Two Simple Polygons by a Sequence of Translations, Technical Report No. 215, Computer Science Department, New York University, 1986. (To appear inDiscrete Comput. Geom.).
D. P. Roselle and R. G. Stanton, Some properties of Davenport-Schinzel sequences,Acta Arith. 17 (1971), 355–362.
M. Sharir, Almost Linear Upper Bounds on the Length of General Davenport-Schinzel Sequences,Combinatorica 7 (1987), 131–143.
M. Sharir, Improved Lower Bound on the Length of Davenport-Schinzel Sequences, Technical Report No. 204, Computer Science Department, New York University, 1986. (To appear inCombinatorica.)
E. Szemeredi, On a problem of Davenport and Schinzel,Acta Arith. 25 (1974), 213–224.
J. Pach and M. Sharir, The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis, Technical Report No. 279, Computer Science Department, New York University, 1987.
Author information
Authors and Affiliations
Additional information
Work on this paper has been partially supported by Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation, and the IBM Corporation. This paper is part of the first author's M.Sc. thesis prepared at Tel Aviv University under the supervision of the second author. A preliminary version of this paper has appeared inProceedings of the 27th IEEE Symposium on Foundations of Computer Science, Toronto, 97–106, 1986.
Rights and permissions
About this article
Cite this article
Wiernik, A., Sharir, M. Planar realizations of nonlinear davenport-schinzel sequences by segments. Discrete Comput Geom 3, 15–47 (1988). https://doi.org/10.1007/BF02187894
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187894