Call Boomerang Books 1300 36 33 32

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.

Buy Intersection and Decomposition Algorithms for Planar Arrangements book by Pankaj K. Agarwal from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780521404464
ISBN-10: 0521404460
Format: Hardback
(239mm x 170mm x 17mm)
Pages: 294
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 26-Apr-1991
Country of Publication: United Kingdom

Other Editions

Reviews

» Have you read this book? We'd like to know what you think about it - write a review about Intersection and Decomposition Algorithms for Planar Arrangements book by Pankaj K. Agarwal and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review


Books By Author Pankaj K. Agarwal

Combinatorial Geometry by Pankaj K. Agarwal

Combinatorial Geometry

Hardback, November 1995
$254.66