Other available formats:
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
This book 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.
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
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
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.×