Efficient structures for geometric data management
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 da...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Thèse numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
337 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Efficient structures for geometric data management, Oliver Günther, Berlin, Springer-Verlag, 1988, 1 vol. (XI-135 p.), Lecture notes in computer science, 3-540-50463-X • Efficient Structures for Geometric Data Management, Texte imprimé, 9783662202296 |
جدول المحتويات:
- 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.