Efficient Structures for Geometric Data Management [electronic resource] /
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.
Main Authors: | , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1988
|
Subjects: | Computer science., Data structures (Computer science)., Algorithms., Database management., Artificial intelligence., Computer graphics., Computer Science., Algorithm Analysis and Problem Complexity., Data Structures., Database Management., Artificial Intelligence (incl. Robotics)., Computer Graphics., Information Systems Applications (incl. Internet)., |
Online Access: | http://dx.doi.org/10.1007/BFb0046097 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|