Intersection and Decomposition Algorithms for Planar Arrangements
- Publisher's listprice GBP 114.00
-
57 695 Ft (54 948 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 11 539 Ft off)
- Discounted price 46 156 Ft (43 958 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
57 695 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 26 April 1991
- ISBN 9780521404464
- Binding Hardback
- No. of pages294 pages
- Size 238x156x19 mm
- Weight 556 g
- Language English 0
Categories
Short description:
This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane.
MoreLong description:
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.
MoreTable of Contents:
Introduction; 1. Davenport-Schinzel sequences; 2. Red-blue intersection detection algorithms; 3. Partitioning arrangements of lines; 4. Applications of the partitioning algorithm; 5. Spanning trees with low stabbing number; Bibliography; Index of symbols; Index of keywords.
More
