Książka Intersection and Decomposition Algorithms for Planar Arrangements Pankaj K. Agarwal

Intersection and Decomposition Algorithms for Planar Arrangements

Język: Angielski
Oprawa: Miękka
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
206.00
Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Informacje o książce

Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2011
strony
296
EAN
9780521168472
ISBN
0521168473
Enbook ID
02024332
Waga
44
Wymiary
162 x 231 x 19

Pełny opis

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.

Możesz być zainteresowany

Kuwait SMEs

Ahmed A. Ahmed
132.01
113.80

My Space Adventure

Naomi Wilkinson
77.78
179.91

Lincoln

Ray John De Aragon
85.76
966.26

King's Comrade

Charles Watts Whistler
55.58
29.59
253.70
511.11

Little Guides to Style

Emma Baxter-Wright
187.30
99.10

Klienci, którzy kupili tę książkę, kupili również

Elia - von Gott bewegt

Noor van Haaften
42.34

Stille Helden

Ida Boy-Ed
73.79