<電子ブック>
Towards Dynamic Randomized Algorithms in Computational Geometry / by Monique Teillaud
(Lecture Notes in Computer Science. ISSN:16113349 ; 758)
版 | 1st ed. 1993. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1993 |
本文言語 | 英語 |
大きさ | XI, 169 p : online resource |
著者標目 | *Teillaud, Monique author SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Computer graphics LCSH:Algorithms LCSH:Discrete mathematics LCSH:Geometry FREE:Theory of Computation FREE:Computer Graphics FREE:Algorithms FREE:Discrete Mathematics FREE:Geometry |
一般注記 | 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 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. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms HTTP:URL=https://doi.org/10.1007/3-540-57503-0 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540482024 |
|
電子リソース |
|
EB00225424 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4001090198 |
ISBN | 9783540482024 |