| Description |
1 online resource (xi, 135 pages) : illustrations |
| Series |
Lecture notes in computer science ; 337 |
|
Lecture notes in computer science ; 337.
|
| Contents |
Introduction -- 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 -- References |
| Summary |
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 |
| Bibliography |
Includes bibliographical references (pages 127-135) |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL |
|
Print version record |
| Subject |
Data structures (Computer science)
|
|
Database management.
|
|
Data structures (Computer science)
|
|
Database management
|
|
Geometrieverarbeitung
|
|
base de données -- gestion -- structure de données.
|
| Form |
Electronic book
|
| ISBN |
9783540460077 |
|
3540460071 |
|
