Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2011-05-20
59,89 € 99,81 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

This book 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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

This book 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.

Lisateave

Autor Pankaj K. Agarwal
Kirjastaja Cambridge University Press
Väljalaskeaasta 2011
Kaanetüüp Pehme kaanega
EAN 9780521168472
Kirjuta oma arvustus
Te vaatate: Intersection and Decomposition Algorithms for Planar Arrangements
Teie hinnang:

Goodreads'i arvustused

59,89 € 99,81 €