Kinetic bounding volume hierarchies for deformable objects
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
A 4-approximation algorithm for guarding 1.5-dimensional terrains
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Kinetic pie delaunay graph and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
An $(n,s)$ Davenport--Schinzel sequence, for positive integers $n$ and $s$, is a sequence composed of $n$ symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation $a \cdots b \cdots a \cdots b \cdots$ of length $s+2$ between two distinct symbols $a$ and $b$. The close relationship between Davenport--Schinzel sequences and the combinatorial structure of lower envelopes of collections of functions make the sequences very attractive, because a wide variety of geometric problems can be formulated in terms of lower envelopes. A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems. This paper gives a comprehensive survey on the theory of Davenport--Schinzel sequences and their geometric applications.