Buch, Englisch, 388 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 588 g
Buch, Englisch, 388 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 588 g
ISBN: 978-0-521-13511-5
Verlag: Cambridge University Press
• 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
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 ist leading researchers will be an important resource for students and professionals in combinatorics, computational geometry and related fields.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik Mathematik Geometrie Dynamische Systeme
Weitere Infos & Material
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.
