The efficient management of geometric data, such as points, curves, or polyhedra in arbitrary dimensions, is of great importance in many complex database applications like CAD/CAM, robotics, or computer vision. To provide optimal support for geometric operations, it is crucial to choose efficient data representation schemes. The first part of this book contains a taxonomy and critical survey of common operations and representation schemes for geometric data. Then several new schemes for the efficient support of set operations (union, intersection) and search operations (point location, range search) are presented.

Bibliographic Information

Book Title: Efficient Structures for Geometric Data Management
Editors: Oliver Günther
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0046097
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1988
Softcover ISBN: 978-3-540-50463-4Published: 09 November 1988
eBook ISBN: 978-3-540-46007-7Published: 11 April 2006
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 138
Topics: Algorithm Analysis and Problem Complexity, Data Structures, Database Management, Artificial Intelligence, Computer Graphics, Information Systems Applications (incl. Internet)

Publish with us

Policies and ethics

Efficient Structures for Geometric Data Management

Overview

Access this book

Other ways to access

Table of contents (7 chapters)

Front Matter

Introduction

Operators and representation schemes for geometric data

Polyhedral chains

A dual approach to detect polyhedral intersections in arbitrary dimensions

The cell tree: An index for geometric databases

The arc tree: An approximation scheme to represent arbitrary curved shapes

Conclusions

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation