Titlebook: Data Structures and Efficient Algorithms; Final Report on the B. Monien,Th. Ottmann Book 1992 Springer-Verlag Berlin Heidelberg 1992 algor

拖累

书目名称Data Structures and Efficient Algorithms影响因子(影响力)




书目名称Data Structures and Efficient Algorithms影响因子(影响力)学科排名




书目名称Data Structures and Efficient Algorithms网络公开度




书目名称Data Structures and Efficient Algorithms网络公开度学科排名




书目名称Data Structures and Efficient Algorithms被引频次




书目名称Data Structures and Efficient Algorithms被引频次学科排名




书目名称Data Structures and Efficient Algorithms年度引用




书目名称Data Structures and Efficient Algorithms年度引用学科排名




书目名称Data Structures and Efficient Algorithms读者反馈




书目名称Data Structures and Efficient Algorithms读者反馈学科排名

轻快来事

Andrea Marin,Maria Grazia Vigliotti of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geometry algorithms need it for processing. Additionally, this combination avoids page faults and facilitates the parallelization of t

Affectation

Monika Grabowska,Wojciech Kotłowskiof the objects as well as efficient query processing. To support the index manager, we propose a storage method for handling arbitrary long objects, which is suitable in an environment that demands for clustering and multiple indexing.

Defiance

Tandem Networks with Intermittent Energytial query processing, it substitutes complex computational geometry algorithms by simple and fast algorithms for simple components. In this paper, we present four different decomposition techniques for polygonal shaped objects. The second part of the paper consists of an empirical performance compa

MAL

FLASK

Computer and Information Sciences III the bounding of the search overhead by the extended Young Brothers Wait Concept and the efficient use of a distributed hash table. We give a cost and gain analysis of this hash table showing its superior behavior compared to other approaches..The developed techniques have been incorparated in the d

FLASK

The combination of spatial access methods and computational geometry in geographic database systems of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geometry algorithms need it for processing. Additionally, this combination avoids page faults and facilitates the parallelization of t

gregarious

A flexible and extensible index manager for spatial database systems,of the objects as well as efficient query processing. To support the index manager, we propose a storage method for handling arbitrary long objects, which is suitable in an environment that demands for clustering and multiple indexing.

冒失

致词

,Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objec using . space. This statement still holds if we demand that the cluster radii, which appear on a path from the root down to a leaf, should generate a geometrically decreasing sequence..We report on extensive experimental results which show that Monotonous Bisector Trees support a large variety of p