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

Intersection and Decomposition Algorithms for Planar Arrangements

Jazyk: Angličtina
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 9-15 dnů
3 474
Several geometric problems can be formulated in terms of the arrangement of a collection of curves i...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
1991
Stránek
294
EAN
9780521404464
ISBN
0521404460
Enbook ID
02029781
Hmotnost
556
Rozměry
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 zajímat

2 164
671
692

Fashion Bible

Sharpe Enterprises Inc
566

MOTHERLAND

LUKE PEPERA
511
1 120
2 286

Zákaznicí kteří koupili tuto knihu koupili také

330

TOURBE

SERRANO PEDRO
376

Lapbook Mein Körper

Svenja Ernsten
298

Indie

Jan Filipský
145
727

Expertenwissen

Wolfgang Schulz
1 178
357

Leseclub

Jutta Douvitsas
178
541