Davenport–Schinzel Sequences and their Geometric Applications
Seiten
2010
Cambridge University Press (Verlag)
978-0-521-13511-5 (ISBN)
Cambridge University Press (Verlag)
978-0-521-13511-5 (ISBN)
Provides a comprehensive treatment of Davenport–Schinzel sequences, one of the most fundamental and sophisticated tools for solving problems in computational and combinatorial geometry. Applications arise in areas as diverse as robot motion planning, computer graphics and pattern matching.
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.
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.
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.
| Erscheint lt. Verlag | 11.3.2010 |
|---|---|
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 540 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-521-13511-7 / 0521135117 |
| ISBN-13 | 978-0-521-13511-5 / 9780521135115 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
