LEADER 03952nam  22006615  450 
001 996466335603316
005 20200705173722.0
010   $a3-540-40961-0
024 7 $a10.1007/BFb0014927
035   $a(CKB)1000000000230274
035   $a(SSID)ssj0000322535
035   $a(PQKBManifestationID)11222864
035   $a(PQKBTitleCode)TC0000322535
035   $a(PQKBWorkID)10301308
035   $a(PQKB)11332209
035   $a(DE-He213)978-3-540-40961-8
035   $a(PPN)155211013
035   $a(EXLCZ)991000000000230274
100   $a20121227d1983      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 14$aThe Design of Dynamic Data Structures$b[electronic resource] /$fby Mark H. Overmars
205   $a1st ed. 1983.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1983.
215   $a1 online resource (VII, 181 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v156
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-12330-X 
327   $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.
330   $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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v156
606   $aApplication software
606   $aComputers
606   $aComputer graphics
606   $aData structures (Computer science)
606   $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aScience, Humanities and Social Sciences, multidisciplinary$3https://scigraph.springernature.com/ontologies/product-market-codes/A11007
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
615  0$aApplication software.
615  0$aComputers.
615  0$aComputer graphics.
615  0$aData structures (Computer science).
615 14$aComputer Applications.
615 24$aTheory of Computation.
615 24$aScience, Humanities and Social Sciences, multidisciplinary.
615 24$aComputer Graphics.
615 24$aData Structures.
676   $a004
700   $aOvermars$b Mark H$4aut$4http://id.loc.gov/vocabulary/relators/aut$0535120
906   $aBOOK
912   $a996466335603316
996   $aDesign of dynamic data structures$9923179
997   $aUNISA