𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] The Design of Dynamic Data Structures Volume 156 || Global rebuilding

✍ Scribed by ,


Book ID
121082306
Publisher
Springer-Verlag
Year
1983
Tongue
German
Weight
578 KB
Category
Article
ISBN-13
9783540123309

No coin nor oath required. For personal study only.

✦ Synopsis


In 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.


πŸ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] The
✍ , πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 German βš– 781 KB

In 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

[Lecture Notes in Computer Science] The
✍ , πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 German βš– 315 KB

In 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

[Lecture Notes in Computer Science] The
✍ , πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 German βš– 862 KB

In 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

[Lecture Notes in Computer Science] The
✍ , πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 German βš– 895 KB

In 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

[Lecture Notes in Computer Science] The
✍ , πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 German βš– 148 KB

In 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