Towards Dynamic Randomized Algorithms in Computational Geometry by Monique TeillaudTowards Dynamic Randomized Algorithms in Computational Geometry by Monique Teillaud

Towards Dynamic Randomized Algorithms in Computational Geometry

byMonique Teillaud

Paperback | November 23, 1993

Pricing and Purchase Info

$114.32 online 
$128.95 list price save 11%
Earn 572 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms.
Title:Towards Dynamic Randomized Algorithms in Computational GeometryFormat:PaperbackDimensions:176 pagesPublished:November 23, 1993Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540575030

ISBN - 13:9783540575030

Look for similar items by category:


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.