You might also like

More about Towards Dynamic Randomized Algorithms in Computational Geometry

• Book details
• Synopsis
• Trending among others

You get 125 loyalty points

Book synopsis

Computational geometry concerns itself with designing andanalyzing 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 hot test 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 efficiencyof randomized dynamic algorithms.

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

• Full title: Towards Dynamic Randomized Algorithms in Computational Geometry
• Author: Monique Teillaud
• Language: English
• Binding: Paperback
• Number of pages: 169
• EAN: 9783540575030
• ISBN: 3540575030
• ID: 01565744
• Publisher: Springer, Berlin
• Weight: 243 g
• Dimensions: 233 × 155 × 9 mm
• Published: 1993

Trending among others

---

---

---