Intersection and Decomposition Algorithms for Planar Arrangements
Pankaj K. Agarwal
Broschiertes Buch

Intersection and Decomposition Algorithms for Planar Arrangements

Versandkostenfrei!
Versandfertig in 1-2 Wochen
46,99 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
23 °P sammeln!
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 effic...