Efficient Structures for Geometric Data Management [electronic resource] /
edited by Oliver Günther.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1988.
- XIV, 138 p. online resource.
- Lecture Notes in Computer Science, 337 0302-9743 ; .
- Lecture Notes in Computer Science, 337 .
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.
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.
9783540460077
10.1007/BFb0046097 doi
Computer science.
Data structures (Computer science).
Computer software.
Database management.
Information systems.
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).
QA76.9.A43
005.1
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.
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.
9783540460077
10.1007/BFb0046097 doi
Computer science.
Data structures (Computer science).
Computer software.
Database management.
Information systems.
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).
QA76.9.A43
005.1