20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Towards Dynamic Randomized Algorithms in Computational Geometry - Monique Teillaud

English
1993-11-23
€67.74 €84.68

-20% with code BOOKS

In stock at our supplier

Shipping in 12-18 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Author Monique Teillaud
Publisher Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Release year 1993
Cover type Softcover
EAN 9783540575030
Write Your Own Review
You're reviewing: Towards Dynamic Randomized Algorithms in Computational Geometry
Your Rating:

Goodreads Reviews

€67.74 €84.68