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

Intersection and Decomposition Algorithms for Planar Arrangements

Limbă: engleză
Legare: Carte broșată
Disponibilitate: În depozitul extern
Expediem în 9-15 zile
266.26 lei
Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2011
Pagini
296
EAN
9780521168472
ISBN
0521168473
Enbook ID
02024332
Greutate
44
Dimensiuni
162 x 231 x 19

Descriere completă

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.

S-ar putea să te intereseze

Kuwait SMEs

Ahmed A. Ahmed
172.80 lei
148.80 lei

My Space Adventure

Naomi Wilkinson
96.17 lei
235.31 lei

Lincoln

Ray John De Aragon
106.05 lei
1 246.75 lei

King's Comrade

Charles Watts Whistler
72.68 lei
38.60 lei
327.76 lei
631.53 lei

Little Guides to Style

Emma Baxter-Wright
247.91 lei
122.39 lei

Clienții care au cumpărat această carte au mai cumpărat și

Elia - von Gott bewegt

Noor van Haaften
46.16 lei

Stille Helden

Ida Boy-Ed
96.58 lei