![Efficient Structures for Geometric Data Management [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
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.
Saved in:
| 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!
|
| id |
KOHA-OAI-TEST:191483 |
|---|---|
| record_format |
koha |
| spelling |
KOHA-OAI-TEST:1914832018-07-30T23:15:34ZEfficient Structures for Geometric Data Management [electronic resource] / Günther, Oliver. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1988.engThe 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.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.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).Springer eBookshttp://dx.doi.org/10.1007/BFb0046097URN:ISBN:9783540460077 |
| institution |
COLPOS |
| collection |
Koha |
| country |
México |
| countrycode |
MX |
| component |
Bibliográfico |
| access |
En linea En linea |
| databasecode |
cat-colpos |
| tag |
biblioteca |
| region |
America del Norte |
| libraryname |
Departamento de documentación y biblioteca de COLPOS |
| language |
eng |
| topic |
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). 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). |
| spellingShingle |
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). 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). Günther, Oliver. editor. SpringerLink (Online service) Efficient Structures for Geometric Data Management [electronic resource] / |
| description |
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. |
| format |
Texto |
| topic_facet |
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). |
| author |
Günther, Oliver. editor. SpringerLink (Online service) |
| author_facet |
Günther, Oliver. editor. SpringerLink (Online service) |
| author_sort |
Günther, Oliver. editor. |
| title |
Efficient Structures for Geometric Data Management [electronic resource] / |
| title_short |
Efficient Structures for Geometric Data Management [electronic resource] / |
| title_full |
Efficient Structures for Geometric Data Management [electronic resource] / |
| title_fullStr |
Efficient Structures for Geometric Data Management [electronic resource] / |
| title_full_unstemmed |
Efficient Structures for Geometric Data Management [electronic resource] / |
| title_sort |
efficient structures for geometric data management [electronic resource] / |
| publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg, |
| publishDate |
1988 |
| url |
http://dx.doi.org/10.1007/BFb0046097 |
| work_keys_str_mv |
AT guntherolivereditor efficientstructuresforgeometricdatamanagementelectronicresource AT springerlinkonlineservice efficientstructuresforgeometricdatamanagementelectronicresource |
| _version_ |
1756266200516526080 |