|
|
|
|
| LEADER |
02180nmm a2200385 u 4500 |
| 001 |
EB000656934 |
| 003 |
EBX01000000000000000510016 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540460077
|
| 100 |
1 |
|
|a Günther, Oliver
|
| 245 |
0 |
0 |
|a Efficient Structures for Geometric Data Management
|h Elektronische Ressource
|c by Oliver Günther
|
| 250 |
|
|
|a 1st ed. 1988
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1988, 1988
|
| 300 |
|
|
|a XIV, 138 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Database Management
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 653 |
|
|
|a Database management
|
| 653 |
|
|
|a Data Science
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0046097
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0046097?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518.1
|
| 520 |
|
|
|a 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
|