000 | 02686nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-48202-4 | ||
003 | DE-He213 | ||
005 | 20160624102031.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1993 gw | s |||| 0|eng d | ||
020 |
_a9783540482024 _9978-3-540-48202-4 |
||
024 | 7 |
_a10.1007/3-540-57503-0 _2doi |
|
050 | 4 | _aT385 | |
072 | 7 |
_aUML _2bicssc |
|
072 | 7 |
_aCOM012000 _2bisacsh |
|
082 | 0 | 4 |
_a006.6 _223 |
100 | 1 |
_aTeillaud, Monique. _eauthor. |
|
245 | 1 | 0 |
_aTowards Dynamic Randomized Algorithms in Computational Geometry _h[electronic resource] / _cby Monique Teillaud. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
300 |
_aXI, 169 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v758 |
|
505 | 0 | _aFundamental 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. | |
520 | _aComputational 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aCombinatorics. | |
650 | 0 | _aGeometry. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aGeometry. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540575030 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v758 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-57503-0 |
942 |
_2EBK6362 _cEBK |
||
999 |
_c35656 _d35656 |