Noch Fragen? 0800 / 33 82 637

Towards Dynamic Randomized Algorithms in Computational Geometry

Produktform: Buch / Einband - flex.(Paperback)

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.weiterlesen

Dieser Artikel gehört zu den folgenden Serien

Sprache(n): Englisch

ISBN: 978-3-540-57503-0 / 978-3540575030 / 9783540575030

Verlag: Springer Berlin

Erscheinungsdatum: 23.11.1993

Seiten: 169

Auflage: 1

Zielgruppe: Research

Autor(en): Monique Teillaud

53,49 € inkl. MwSt.
kostenloser Versand

sofort lieferbar - Lieferzeit 1-3 Werktage

zurück