Intersection and Decomposition Algorithms for Planar Arrangements
By
Pankaj K. Agarwal (Author)
Paperback
Available / dispatched within 1 - 2 weeks
Quantity
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. Worked examples or Exercises
More Details
- Contributor: Pankaj K. Agarwal
- Imprint: Cambridge University Press
- ISBN13: 9780521168472
- Number of Pages: 296
- Packaged Dimensions: 152x229x17mm
- Packaged Weight: 440
- Format: Paperback
- Publisher: Cambridge University Press
- Release Date: 2011-08-11
- Binding: Paperback / softback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.