Intersection and Decomposition Algorithms for Planar Arrangements

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.