TY  - BOOK
AU  - Günther,Oliver
ED  - SpringerLink (Online service)
TI  - Efficient Structures for Geometric Data Management
T2  - Lecture Notes in Computer Science,
SN  - 9783540460077
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 1988///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Data structures (Computer science)
KW  - Computer software
KW  - Database management
KW  - Information systems
KW  - Artificial intelligence
KW  - Computer graphics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Data Structures
KW  - Database Management
KW  - Artificial Intelligence (incl. Robotics)
KW  - Computer Graphics
KW  - Information Systems Applications (incl.Internet)
N1  - 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
N2  - 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
UR  - http://dx.doi.org/10.1007/BFb0046097
ER  -