Delivery included to the United States

Towards Dynamic Randomized Algorithms in Computational Geometry

Towards Dynamic Randomized Algorithms in Computational Geometry - Lecture Notes in Computer Science

1993

Paperback (23 Nov 1993)

Save $6.16

  • RRP $61.06
  • $54.90
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783540575030
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
Edition: 1993
Language: English
Number of pages: 169
Weight: 590g
Height: 233mm
Width: 155mm
Spine width: 9mm