Könyv Intersection and Decomposition Algorithms for Planar Arrangements Pankaj K. Agarwal

Intersection and Decomposition Algorithms for Planar Arrangements

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 9-15 napon belül
18 511 Ft
Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2011
oldal
296
EAN
9780521168472
ISBN
0521168473
Enbook ID
02024332
Súly
44
Méretek
162 x 231 x 19

Teljes leírás

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.

Érdekelheti

Kuwait SMEs

Ahmed A. Ahmed
12 082 Ft
10 406 Ft

My Space Adventure

Naomi Wilkinson
6 510 Ft
16 462 Ft

Lincoln

Ray John De Aragon
7 433 Ft

King's Comrade

Charles Watts Whistler
5 075 Ft
2 685 Ft
22 775 Ft

Little Guides to Style

Emma Baxter-Wright
17 458 Ft
8 289 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Elia - von Gott bewegt

Noor van Haaften
3 241 Ft

Stille Helden

Ida Boy-Ed
6 752 Ft