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

Intersection and Decomposition Algorithms for Planar Arrangements

Język: Angielski
Oprawa: Twarda
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
638.52
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 - Twarda
Data wydania
1991
strony
294
EAN
9780521404464
ISBN
0521404460
Enbook ID
02029781
Waga
556
Wymiary
156 x 238 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

395.93
123.91
127.91

Fashion Bible

Sharpe Enterprises Inc
104.04
141.94

MOTHERLAND

LUKE PEPERA
96.05
207.99
423.79
517.81

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

57.76

TOURBE

SERRANO PEDRO
65.95
41.01

Lapbook Mein Körper

Svenja Ernsten
55.23

Indie

Jan Filipský
28.24
127.32

Expertenwissen

Wolfgang Schulz
218.32
66.43

Leseclub

Jutta Douvitsas
31.07
101.51