
Intersection and Decomposition Algorithms for Planar Arrangements
Pankaj K. Agarwal(Author)
Cambridge University Press
Published on 26. April 1991
Book
Hardback
294 pages
978-0-521-40446-4 (ISBN)
Description
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.
More details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 20 mm
Weight
580 gr
ISBN-13
978-0-521-40446-4 (9780521404464)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Pankaj K. Agarwal
Intersection and Decomposition Algorithms for Planar Arrangements
Book
08/2011
Cambridge University Press
€51.10
Shipment within 15-20 days
Person
Content
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.