Davenport–Schinzel Sequences and their Geometric Applications
These sequences exhibit some surprising properties that make them a fascinating subject for research in combinatorial analysis. This 1995 book on the subject by two of its leading researchers will be an important resource for students and professionals in combinatorics, computational geometry and related fields.
- First book, published in 1995, on widespread technique in computational geometry
- The authors are the key players in the area
- Wide readership in theoretical computer science, computational geometry, discrete and combinatorial geometry, robotics and combinatorics
Reviews & endorsements
Review of the hardback: 'This is a very well written and readable book suitable as a textbook for upper undergraduate and junior graduate students. It is entirely selfcontained.' European Mathematical Society Newsletter
Review of the hardback: 'I am very impressed by the book and highly recommend it to anyone who is interested in computational geometry.' K. Kedem, The Computer Journal
Product details
March 2010Paperback
9780521135115
388 pages
234 × 156 × 20 mm
0.54kg
Available
Table of Contents
- 1. Introduction
- 2. Davenport–Schinzel sequences of order 3
- 3. Higher order sequences
- 4. Geometric realization
- 5. Planar arrangements
- 6. Algorithms for arrangements
- 7. Arrangements in higher dimensions
- 8. Geometric applications
- Bibliography.