Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. The first problem is a proof of almost tight bounds on the length of (n,s)-Davenport–Schinzel sequences, a technique for obtaining optimal bounds for numerous algorithmic problems. Then the intersection problem is treated. The final problem is improving the efficiency of partitioning algorithms, particularly those used to construct spanning trees with low stabbing numbers, a very versatile tool in solving geometric problems. A number of applications are also discussed. Researchers in computational and combinatorial geometry should find much to interest them in this book.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: August 2011
- format: Paperback
- isbn: 9780521168472
- length: 296 pages
- dimensions: 229 x 152 x 17 mm
- weight: 0.44kg
- availability: Available
Table of Contents
1. Davenport–Schinzel sequences
2. Red-blue intersection detection algorithms
3. Partitioning arrangements of lines
4. Applications of the partitioning algorithm
5. Spanning trees with low stabbing number
Index of symbols
Index of keywords.
Sorry, this resource is locked
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×