Applications of Davenport-Schinzel sequences arise in areas as diverse as robot motion planning, computer graphics and vision, and pattern matching. These sequences exhibit some surprising properties that make them a fascinating subject for research in combinatorial analysis. This book provides a comprehensive study of the combinatorial properties of Davenport-Schinzel sequences and their numerous geometric applications. These sequences are sophisticated tools for solving problems in computational and combinatorial geometry. This first 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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Review
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
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
Book Description
This book provides a comprehensive study of the theory of Davenport-Schinzel sequences and its geometric applications. These sequences are 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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Definition 1.1 Let n, s be positive integers. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
constant description complexity, constant maximum degree, computing lower envelopes, lower envelope sequence, leftmost appearance, alternating subsequence, maximum combinatorial complexity, minimization diagram, ath fan, geometric permutations, equal adjacent elements, randomized expected time, randomized incremental algorithm, zone theorem, combinatorial changes, polyhedral terrain, trivariate functions, lower bound construction, free configuration space, vertical decomposition, combination lemma, bivariate functions, general position assumption, lowest vertex, polygonal obstacles Key Phrases - Capitalized Phrases (CAPs): (learn more)
Consistency Lemma, Chopping Theorem New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Definition 1.1 Let n, s be positive integers. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
constant description complexity, constant maximum degree, computing lower envelopes, lower envelope sequence, leftmost appearance, alternating subsequence, maximum combinatorial complexity, minimization diagram, ath fan, geometric permutations, equal adjacent elements, randomized expected time, randomized incremental algorithm, zone theorem, combinatorial changes, polyhedral terrain, trivariate functions, lower bound construction, free configuration space, vertical decomposition, combination lemma, bivariate functions, general position assumption, lowest vertex, polygonal obstacles Key Phrases - Capitalized Phrases (CAPs): (learn more)
Consistency Lemma, Chopping Theorem New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 27
books:
See all 27 books this book cites
21
books
cite this book:
See all 21 books citing this book
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg on 6 pages
- New Trends in Discrete and Computational Geometry (Algorithms and Combinatorics) by Janos Pach in Back Matter (1), and Back Matter (2)
- Computing in Euclidean Geometry (Lecture Notes Series on Computing) by Ding-Zhu Du in Back Matter (1), and Back Matter (2)
- Provability, Computability and Reflection, Volume 90 (Studies in Logic and the Foundations of Mathematics) by Lev D. Beklemishev in Back Matter
- Oriented Matroids (Encyclopedia of Mathematics and its Applications) by Anders Björner in Back Matter
See all 27 books this book cites
- Discrete and Computational Geometry by Jin Akiyama on page 80, and page 307
- Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings (Lecture Notes in Computer Science) by Torben Hagerup on page 126
- Algorithms and Data Structures: 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings (Lecture Notes in Computer Science) by Frank Dehne on page 139
- Algorithm Engineering: 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings (Lecture Notes in Computer Science) by Jeffrey S. Vitter on page 153
- Encyclopedia of Computer Science and Technology by Allen Kent on page 114
See all 21 books citing this book
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
