
Towards Dynamic Randomized Algorithms in Computational Geometry
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
Computational geometry concerns itself with designing and analyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed.However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
- Kartoniert
- 408 Seiten
- Erschienen 2003
- Springer
- Gebunden
- 150 Seiten
- Erschienen 2016
- Springer
- hardcover
- 379 Seiten
- Erschienen 1999
- Springer
- Kartoniert
- 289 Seiten
- Erschienen 2007
- Springer Berlin Heidelberg
- hardcover
- 608 Seiten
- Erschienen 1992
- Springer
- Kartoniert
- 813 Seiten
- Erschienen 2011
- Springer
- hardcover
- 562 Seiten
- Erschienen 1995
- CRC Press Inc
- hardcover
- 192 Seiten
- Erschienen 2023
- Wiley