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

Intersection and Decomposition Algorithms for Planar Arrangements

Paperback

Published: 11th August 2011
RRP $50.95
$47.80
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

Other Available Formats (Hide)

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.

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: 9780521168472
ISBN-10: 0521168473
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 296
Published: 11th August 2011
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 22.9 x 15.2  x 1.7
Weight (kg): 0.44