---

＜電子ブック＞
Efficient Structures for Geometric Data Management / by Oliver Günther
(Lecture Notes in Computer Science. ISSN:16113349 ; 337)

版	1st ed. 1988.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1988
本文言語	英語
大きさ	XIV, 138 p : online resource
著者標目	*Günther, Oliver author SpringerLink (Online service)
件　名	LCSH:Algorithms LCSH:Artificial intelligence -- Data processing  全ての件名で検索 LCSH:Database management LCSH:Artificial intelligence LCSH:Computer graphics LCSH:Application software FREE:Algorithms FREE:Data Science FREE:Database Management FREE:Artificial Intelligence FREE:Computer Graphics FREE:Computer and Information Systems Applications
一般注記	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 HTTP:URL=https://doi.org/10.1007/BFb0046097

 類似資料