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

Intersection and Decomposition Algorithms for Planar Arrangements

Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
143.81
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 - Pevná
Vydalo
1991
Stránok
294
EAN
9780521404464
ISBN
0521404460
Enbook ID
02029781
Hmotnosť
556
Rozmery
156 x 238 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ť

27.81
21.32

Lyndoniad

William Guy
20.63
28.60

Fashion Bible

Sharpe Enterprises Inc
23.49
33.51
92.69
122.48
111.37
54.26

MOTHERLAND

LUKE PEPERA
22.70

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

TOURBE

SERRANO PEDRO
15.62
12.57
13.65

Lapbook Mein Körper

Svenja Ernsten
15.52

Indie

Jan Filipský
6.91
31.64

Expertenwissen

Wolfgang Schulz
58.97
30.27

Leseclub

Jutta Douvitsas
7.36
21.17