David Eppstein

Forbidden Configurations in Discrete Geometry

• Gebundenes Buch

Produktbeschreibung

Unifies discrete and computational geometry by using forbidden patterns of points to characterize many of its problems.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 242
• Erscheinungstermin: 8. März 2019
• Englisch
• Abmessung: 235mm x 157mm x 20mm
• Gewicht: 678g
• ISBN-13: 9781108423915
• ISBN-10: 1108423914
• Artikelnr.: 50014557

Autorenporträt

David Eppstein is Chancellor's Professor of Computer Science at the University of California, Irvine. He has over 350 publications on subjects including discrete and computational geometry, graph theory, graph algorithms, data structures, robust statistics, social network analysis and visualization, mesh generation, biosequence comparison, exponential algorithms, and recreational mathematics. He has been the moderator for data structures and algorithms on arXiv.org since 2006, and is a major contributor to Wikipedia's articles on mathematics and theoretical computer science. He was elected as an ACM fellow in 2012.

Inhaltsangabe

1. A happy ending
2. Overview
3. Configurations
4. Subconfigurations
5. Properties, parameters, and obstacles
6. Computing with configurations
7. Complexity theory
8. Collinearity
9. General position
10. General-position partitions
11. Convexity
12. More on convexity
13. Integer realizations
14. Stretched permutations
15. Configurations from graphs
16. Universality
17. Stabbing
18. The big picture.