Intersection and Decomposition Algorithms for Planar Arrangements
By (author) Pankaj K. Agarwal
Normal Price: $225.00
Your Price: $202.50 AUD, inc. GST
Shipping: $7.95 per order
You Save: $22.50! (10% off normal price)
Plus...earn $10.12 in Boomerang Bucks
Availability: Available to Backorder, No Due Date for Supply
Intersection and Decomposition Algorithms for Planar Arrangements by Pankaj K. Agarwal
Book DescriptionSeveral 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 Bookstore, Boomerang Books.
Book DetailsISBN: 9780521404464
(239mm x 170mm x 17mm)
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 26-Apr-1991
Country of Publication: United Kingdom
Books By Author Pankaj K. Agarwal
Intersection and Decomposition Algorithms for Planar Arrangements, Paperback (December 2010)
This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane.
Davenport-Schinzel Sequences and Their Geometric Applications, Paperback (March 2010)
A comprehensive treatment of a fundamental tool for solving problems in computational and combinatorial geometry.
Combinatorial Geometry, Hardback (November 1995)» View all books by Pankaj K. Agarwal
A complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd???s.
» 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 member - it's free to sign up!)
Bestselling Books: Our Current Bestsellers | Australia's Hottest 1000 Books | Bestselling Fiction | Bestselling Crime Mysteries and Thrillers | Bestselling Non Fiction Books | Bestselling Sport Books | Bestselling Gardening and Handicrafts Books | Bestselling Biographies | Bestselling Food and Drink | Bestselling History | Bestselling Travel Books | Bestselling School Textbooks & Study Guides | Bestselling Children's General Non-Fiction | Bestselling Young Adult Fiction | Bestselling Children's Fiction | Bestselling Picture Books | Top 100 US Bestsellers
Phone: 1300 36 33 32 (9am-2pm Mon-Fri AEST) - International: +61 2 9960 7998 - Online Form
Address: Boomerang Books, 878 Military Road, Mosman Junction, NSW, 2088
© 2003-2016. All Rights Reserved. Eclipse Commerce Pty Ltd - ACN: 122 110 687 - ABN: 49 122 110 687
For every $20 you spend on books, you will receive $1 in Boomerang Bucks loyalty dollars. You can use your Boomerang Bucks as a credit towards a future purchase from Boomerang Books. Note that you must be a Member (free to sign up) and that conditions do apply.