000 | 02982nam a22004815i 4500 | ||
---|---|---|---|
001 | 978-3-540-40961-8 | ||
003 | DE-He213 | ||
005 | 20160624101948.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1983 gw | s |||| 0|eng d | ||
020 |
_a9783540409618 _9978-3-540-40961-8 |
||
024 | 7 |
_a10.1007/BFb0014927 _2doi |
|
050 | 4 | _aT385 | |
072 | 7 |
_aUML _2bicssc |
|
072 | 7 |
_aCOM012000 _2bisacsh |
|
082 | 0 | 4 |
_a006.6 _223 |
100 | 1 |
_aOvermars, Mark H. _eauthor. |
|
245 | 1 | 4 |
_aThe Design of Dynamic Data Structures _h[electronic resource] / _cby Mark H. Overmars. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1983. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1983. |
|
300 |
_aVII, 181 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 ; _v156 |
|
505 | 0 | _aA catalog of (multi-dimensional) searching problems -- Local rebuilding (balancing) -- Partial rebuilding -- Global rebuilding -- Order decomposable set problems -- Decomposable searching problems -- Batched dynamization -- Searching in the past -- Final comments and open problems. | |
520 | _aIn numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aData Structures. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540123309 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v156 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0014927 |
942 |
_2EBK4835 _cEBK |
||
999 |
_c34129 _d34129 |