Efficient Structures for Geometric Data Management

✍ Scribed by Oliver Günther (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1988
• Tongue: English
• Leaves: 144
• Series: Lecture Notes in Computer Science 337
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Introduction....Pages 1-4
Operators and representation schemes for geometric data....Pages 5-30
Polyhedral chains....Pages 31-48
A dual approach to detect polyhedral intersections in arbitrary dimensions....Pages 49-64
The cell tree: An index for geometric databases....Pages 65-84
The arc tree: An approximation scheme to represent arbitrary curved shapes....Pages 85-121
Conclusions....Pages 123-126

✦ Subjects

Algorithm Analysis and Problem Complexity; Data Structures; Database Management; Artificial Intelligence (incl. Robotics); Computer Graphics; Information Systems Applications (incl.Internet)