Skip to main content
SpringerLink
Log in
Book cover

The Design of Dynamic Data Structures

  • Book
  • © 1983

Overview

Authors:
  1. Mark H. Overmars
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 156)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-4

  3. A catalog of (multi-dimensional) searching problems

    Pages 5-29

  4. Local rebuilding (balancing)

    Pages 30-51

  5. Partial rebuilding

    Pages 52-66

  6. Global rebuilding

    Pages 67-77

  7. Order decomposable set problems

    Pages 78-94

  8. Decomposable searching problems

    Pages 95-124

  9. Batched dynamization

    Pages 125-141

  10. Searching in the past

    Pages 142-169

  11. Final comments and open problems

    Pages 170-171

  12. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation