Free Shipping on Order Over $60
AfterPay Available
Intersection and Decomposition Algorithms for Planar Arrangements

Intersection and Decomposition Algorithms for Planar Arrangements

by Pankaj K. Agarwal
Paperback
Publication Date: 11/08/2011
RRP  $58.95 $56.75
      Please Note: We will source your item through a special order. Generally sent within 120 days.
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.
ISBN:
9780521168472
9780521168472
Category:
Combinatorics & graph theory
Format:
Paperback
Publication Date:
11-08-2011
Language:
English
Publisher:
Cambridge University Press
Country of origin:
United Kingdom
Pages:
296
Dimensions (mm):
229x152x17mm
Weight:
0.44kg

Our Australian supplier has this title on order.  You can place a backorder for this title now and we will ship it to you when it becomes available. 

While we are unable to provide a delivery estimate, most backorders will be delivered within 120 days. If we are informed by our supplier that the title is no longer available during this time, we will cancel and refund you for this item.  Likewise, if no delivery estimate has been provided within 120 days, we will contact our supplier for an update.  If there is still no delivery estimate we will then cancel the item and provided you with a refund.

If we are able to secure you a copy of the title, our supplier will despatch it to our Sydney warehouse.  Once received we make sure it is in perfect condition and then despatch it to you via the Australia Post eParcel service, which includes online tracking.  You will receive a shipping notice from us when this occurs.

Customer Reviews

Be the first to review Intersection and Decomposition Algorithms for Planar Arrangements.