| 書目名稱 | Towards Dynamic Randomized Algorithms in Computational Geometry |
| 編輯 | Monique Teillaud |
| 視頻video | http://file.papertrans.cn/927/926917/926917.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | 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 longasthey are based on rigorous methods. One such method is theuse ofrandomized 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 problemareoften acquired progressively. In this monograph the authorstudiesthe theoretical complexity and practical efficiencyof randomized dynamic algorithms. |
| 出版日期 | Book 1993 |
| 關(guān)鍵詞 | Algorithm; Algorithmic Geometry; Algorithmische Geometrie; Area; Computational Geometry; Computergeometri |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-57503-0 |
| isbn_softcover | 978-3-540-57503-0 |
| isbn_ebook | 978-3-540-48202-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1993 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 11:41
發(fā)表于 2025-3-21 19:48:26
