Amazon cover image
Image from Amazon.com

The design of dynamic data structures / Mark H. Overmars.

By: Material type: TextTextSeries: Lecture notes in computer science ; 156.Publication details: Berlin ; New York : Springer-Verlag, 1983.Description: 1 online resource (vii, 181 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540409618
  • 3540409610
Subject(s): Additional physical formats: Print version:Overmars, Mark H., 1958-: Design of dynamic data structures.DDC classification:
  • 001.64 19
LOC classification:
  • QA76.9.D35 O93 1983
Other classification:
  • 54.62
  • SS 4800
  • 28
Online resources:
Contents:
Introduction -- 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 -- References -- Index.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references (pages 172-179) and index.

Introduction -- 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 -- References -- Index.

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.

Powered by Koha