Towards Dynamic Randomized Algorithms in Computational Geometry
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.
1101508923
Towards Dynamic Randomized Algorithms in Computational Geometry
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.
54.99 In Stock
Towards Dynamic Randomized Algorithms in Computational Geometry

Towards Dynamic Randomized Algorithms in Computational Geometry

by Monique Teillaud
Towards Dynamic Randomized Algorithms in Computational Geometry

Towards Dynamic Randomized Algorithms in Computational Geometry

by Monique Teillaud

Paperback(1993)

$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9783540575030
Publisher: Springer Berlin Heidelberg
Publication date: 12/07/1993
Series: Lecture Notes in Computer Science , #758
Edition description: 1993
Pages: 169
Product dimensions: 6.10(w) x 9.17(h) x 0.02(d)

Table of Contents

Fundamental structures.- Static randomized incremental algorithms.- The Delaunay tree.- A general structure: The influence graph.- The k-Delaunay tree.- Towards a fully dynamic structure.- Parallel work.
From the B&N Reads Blog

Customer Reviews