+612 9045 4394
 
CHECKOUT
Towards Dynamic Randomized Algorithms in Computational Geometry : Lecture Notes in Computer Science - Monique Teillaud

Towards Dynamic Randomized Algorithms in Computational Geometry

Lecture Notes in Computer Science

Paperback Published: 23rd November 1993
ISBN: 9783540575030
Number Of Pages: 169

Share This Book:

Paperback

$125.05
or 4 easy payments of $31.26 with Learn more
Ships in 5 to 9 business days

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.

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.

ISBN: 9783540575030
ISBN-10: 3540575030
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 169
Published: 23rd November 1993
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 0.99
Weight (kg): 0.27