Towards Dynamic Randomized Algorithms in Computational Geometry by Monique Teillaud
Towards Dynamic Randomized Algorithms in Computational Geometry (Lecture Notes in Computer Science) by Monique Teillaud
English | Dec 7, 1993 | ISBN: 3540575030, 0387575030 | 152 Pages | PDF | 5 MB
English | Dec 7, 1993 | ISBN: 3540575030, 0387575030 | 152 Pages | PDF | 5 MB
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.