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

Intersection and Decomposition Algorithms for Planar Arrangements

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: Beszállítói készleten
Küldés 9-15 napon belül
57 403 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 - Kemény kötésű
Kiadva
1991
oldal
294
EAN
9780521404464
ISBN
0521404460
Enbook ID
02029781
Súly
556
Méretek
156 x 238 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

33 960 Ft
11 230 Ft
11 571 Ft

Fashion Bible

Sharpe Enterprises Inc
9 368 Ft
11 886 Ft

MOTHERLAND

LUKE PEPERA
8 568 Ft
18 946 Ft
38 542 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

4 839 Ft

TOURBE

SERRANO PEDRO
5 521 Ft
4 372 Ft

Lapbook Mein Körper

Svenja Ernsten
5 041 Ft

Indie

Jan Filipský
2 505 Ft
11 769 Ft

Expertenwissen

Wolfgang Schulz
19 857 Ft
6 077 Ft

Leseclub

Jutta Douvitsas
2 603 Ft
8 497 Ft