Intersection and Decomposition Algorithms for Planar Arrangementsby Pankaj K. Agarwal
Pub. Date: 08/31/2011
Publisher: Cambridge University Press
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.
- Cambridge University Press
- Publication date:
- Product dimensions:
- 5.98(w) x 9.02(h) x 0.67(d)
Table of Contents
Introduction; 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; Bibliography; Index of symbols; Index of keywords.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >