Efficient structures for geometric data management
Author(s)
Bibliographic Information
Efficient structures for geometric data management
（Lecture notes in computer science, 337）
Springer-Verlag, c1988
- : gw
- : us
Available at / 59 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||33788062018
-
Research Institute for Economics & Business Administration (RIEB) Library , Kobe University図書
: gw621.34-446-337s081000079369*
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:337891016790
-
No Libraries matched.
- Remove all filters.
Note
"Revised and extended version of a Ph.D. dissertation submitted to the Department of Electrical Engineering and Computer Sciences, University of California at Berkeley"--Pref
Bibliography: p. [127]-135
Description and Table of Contents
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.
Table of Contents
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.
by "Nielsen BookData"
