+612 9045 4394
 
CHECKOUT
Intersection and Decomposition Algorithms for Planar Arrangements - Pankaj K. Agarwal

Intersection and Decomposition Algorithms for Planar Arrangements

Hardcover

Published: 30th April 2013
Ships: 7 to 10 business days
7 to 10 business days
$270.50
or 4 easy payments of $67.63 with Learn more

Other Available Formats (Hide)

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.

Introduction
Davenport-Schinzel sequences
Red-blue intersection detection algorithms
Partitioning arrangements of lines
Applications of the partitioning algorithm
Spanning trees with low stabbing number
Bibliography
Index of symbols
Index of keywords
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521404464
ISBN-10: 0521404460
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 294
Published: 30th April 2013
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 23.9 x 17.0  x 1.7
Weight (kg): 0.56