• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Intersection and Decomposition Algorithms for Planar Arrangements

Intersection and Decomposition Algorithms for Planar Arrangements

Paperback

General MathematicsGeometry

ISBN10: 0521168473
ISBN13: 9780521168472
Publisher: Cambridge
Published: Aug 11 2011
Pages: 296
Weight: 0.96
Height: 0.67 Width: 6.00 Depth: 9.00
Language: English
This book 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.

1 different editions

Also available

Also in

Geometry