The Design of Dynamic Data Structures by Mark H. OvermarsThe Design of Dynamic Data Structures by Mark H. Overmars

The Design of Dynamic Data Structures

byMark H. Overmars

Paperback | October 1, 1987

Pricing and Purchase Info

$97.81 online 
$116.95 list price save 16%
Earn 489 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:The Design of Dynamic Data StructuresFormat:PaperbackDimensions:188 pages, 9.25 × 6.1 × 0.01 inPublished:October 1, 1987Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:354012330X

ISBN - 13:9783540123309

Look for similar items by category:

Reviews

Table of Contents

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