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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1988.
|
| Series: | Lecture notes in computer science ;
337. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| 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. |
|---|---|
| Item Description: | "Revised and extended version of a Ph. D. dissertation submitted to the Department of Electrical Engineering and Computer Sciences, University of California at Berkeley"--Preface. Electronic resource. |
| Physical Description: | 1 online resource (xi, 135 pages) : illustrations. |
| Format: | 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. |
| Bibliography: | Includes bibliographical references (pages 127-135). |
| ISBN: | 9783540460077 (electronic bk.) 3540460071 (electronic bk.) |