Kniha Intersection and Decomposition Algorithms for Planar Arrangements Pankaj K. Agarwal

Intersection and Decomposition Algorithms for Planar Arrangements

Jazyk: Angličtina
Väzba: Brožovaná
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
46.36
Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
2011
Stránok
296
EAN
9780521168472
ISBN
0521168473
Enbook ID
02024332
Hmotnosť
44
Rozmery
162 x 231 x 19

Kompletný popis

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.

Mohlo by vás zaujímať

Kuwait SMEs

Ahmed A. Ahmed
31.13
26.91

My Space Adventure

Naomi Wilkinson
18.36
42.53

Lincoln

Ray John De Aragon
19.05
218.19

King's Comrade

Charles Watts Whistler
13.15
6.97
59.92
120.73

Little Guides to Style

Emma Baxter-Wright
49.80
23.37

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Elia - von Gott bewegt

Noor van Haaften
8.34

Stille Helden

Ida Boy-Ed
17.38