Intersection and Decomposition Algorithms for Planar Arrangements

di Pankaj K. Agarwal (Autore)

Cambridge University Press, 1991

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.

• Autore: Pankaj K. Agarwal
• Editore: Cambridge University Press
• Anno: 1991
• Rilegatura: Hardback
• Pagine: 294 p.
• Dimensioni: 238 x 156 mm
• Peso: 556 gr.
• EAN: 9780521404464

Testo in English