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...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
758 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Towards dynamic randomized algorithms in computational geometry, Monique Teillaud, Berlin, Springer-Verlag, 1993, 1 vol. (IX-156 p.), Lecture notes in computer science, 0-387-57503-0 • Towards Dynamic Randomized Algorithms in Computational Geometry, Texte imprimé, 9783662186589 |
Mục lục:
- 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.