On the two-dimensional davenport-schinzel problem
Open Access
- 1 January 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (3-4) , 371-393
- https://doi.org/10.1016/s0747-7171(08)80070-3
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1987
- Almost linear upper bounds on the length of general davenport—schinzel sequencesCombinatorica, 1987
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Searching and storing similar listsJournal of Algorithms, 1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Voronoi diagrams and arrangementsDiscrete & Computational Geometry, 1986
- On the number of line separations of a finite set in the planeJournal of Combinatorial Theory, Series A, 1985
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965