检索结果-内蒙古大学图书馆

CONSISTENT OPERATIONS ON A spatial data structure

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1986年第4期8卷 532-538页

作者： MEIER, A ILG, M SWISS FED INST TECHNOL IKTIMAGE SCI GRPCH-8092 ZURICHSWITZERLAND

Geometric objects such as polygons, line segments, and points may have manifold relations among each other, i.e., order, adjacency, connectivity, etc., and may be stored in a database. For the design of the spatial data structure and in order to preserve consistency when manipulating the data, we propose a graph grammar approach. All consistent states are described by a structure graph, and the manipulation rules are given by productions where intersection problems as well as topologic properties have to be solved. By appropriately modeling the behavior of geographic data, consistency is preserved at all times. This eliminates the tedious case of recovering a geographic database after an inconsistency has been detected.

关键词： data structures spatial databases Geographic Information Systems Visual databases Production Law Legal factors Registers data security Protection Author Keywords spatial data structure Consistency geographic database maps polygons productions

来源：评论

学校读者我要写书评

暂无评论

An Improved spatial data structure for Web-based Large-scale 3D Scene 10

An Improved Spatial Data Structure for Web-based Large-scale...

引用

10th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Chen, Jiaxi Fang, Wei Beijing Univ Posts & Telecommun Sch Comp Sci Beijing Peoples R China

ISBN: (纸本)9781728109459

In order to meet the requirements of large-scale 3D scene transmission, parsing and real-time visualization in the Web environment, a kind of data structure is proposed in this paper, which specifies the logical structure and physical storage format of the 3D spatial data, and can effectively divide and index the 3D scene. Meanwhile, based on the existing spatial index technology, we propose a hybrid index structure R*O-tree which combines the W-tree and the R*-tree to improve the performance. The experimental results show that the proposed data structure can save about 60%-80% disk space, and the improved index structure is more efficient. Our method is more advantageous than the traditional three-dimensional spatial data structure.

关键词： spatial data structure spatial index R*O-tree Web3DGIS

来源：评论

学校读者我要写书评

暂无评论

A Hybrid 3D spatial data structure for the Integration of Aboveground, Ground and Underground Objects

A Hybrid 3D Spatial Data Structure for the Integration of Ab...

引用

18th International Conference on Geoinformatics

作者： Shen, Jingwei Lv, Guonian Wen, Yongning Wu, Mingguang Zhang, Hongping Wang, Xiao Nanjing Normal Univ Key Lab Virtual Geog Environm Minist Educ Nanjing 210046 Jiangsu Provinc Peoples R China

ISBN: (纸本)9781424473021

A hybrid 3D spatial data structure for the integration of aboveground, ground and underground objects based on spatial cognition theory is proposed, which considers the space subdivision and topology completeness. Object-oriented method is used to abstract objects in real world which is defined into three levels. Geometry primitives and topology primitives are defined in this data structure. Topology is the option of the geometry. The geometry information can be coded in a binary method to store in the relation database. An experiment is designed to integrate the buildings, terrain, and geological stratification seamlessly. The data structure could express aboveground, ground and underground objects effectively.

关键词： spatial data structure Object-Oriented Method Aboveground Ground and Underground Integration Seamlessly

来源：评论

学校读者我要写书评

暂无评论

Nearest neighbor search algorithm for GBD tree spatial data structure

Nearest neighbor search algorithm for GBD tree spatial data ...

引用

5th Asian Symposium on Geographic Information System from Computer Science & Engineering View

作者： Yutaka Ohsawa Takanobu Kurihara Ayaka Ohki Saitama University Saitama 338-8570Japan

＜正＞This paper describes the nearest neighbor（NN）search algorithm on the GBD（generalized BD）*** GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteris- tics with respect to the dynamic data *** GIS and CAD systems,the R-tree and its successors have been *** addition,the NN search algorithm is also proposed in an attempt to obtain good performance from the *** the other hand,the GBD tree is superior to the R-tree with respect to exact match retrieval,because the GBD tree has auxiliary data that uniquely determines the position of the object in the *** proposed NN search algorithm depends on the property of the GBD tree described *** NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.

关键词： nearest neighbor search algorithm GBD tree spatial data structure

来源：评论

学校读者我要写书评

暂无评论

spatial data structures for version management of engineering drawings 18

Spatial data structures for version management of engineerin...

引用

18th International Conference on Computers and Their Applications

作者： Nakamura, Y Dekihara, H Hiroshima City Univ Dept Comp Sci Asaminami Ku Hiroshima 7313194 Japan

ISBN: (纸本)1880843463

In the engineering database system, multiple versions of a design including engineering drawings should be managed efficiently. The paper proposes an extended spatial data structure for efficient management of multiversion engineering drawings. The R-tree is adapted as a basic data structure. The efficient mechanism to manage the difference between drawings is introduced to the R-tree to eliminate redundant duplications and to reduce the amount of storage required for the data structure. The extended data structures of the R-tree, MVR and MVR* trees, are developed and the performances of these trees are evaluated. A series of simulation tests shows that, compared with the basic R-tree, the amounts of storage required for the MVR and MVR* trees are reduced to 50% and 30%, respectively. The search efficiencies of the R, MVR, and MVR* trees are almost the same.

关键词： spatial data structure R-tree version management design database

来源：评论

学校读者我要写书评

暂无评论

Nested spatial data structures for optimal indexing of LiDAR data

引用

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING 2023年 195卷 287-297页

作者： Ogayar-Anguita, Carlos J. Lopez-Ruiz, Alfonso Rueda-Ruiz, Antonio J. Segura-Sanchez, Rafael J. Univ Jaen Dept Comp Sci EPS Jaen Jaen 23071 Spain

In this paper we present a flexible framework for creating spatial data structures to manage LiDAR point clouds in the context of spatial big data. For this purpose, standard approaches typically include the use of a single data structure to index point clouds. Some of them use a hybrid two-tier solution to optimize specific application purposes such as storage or rendering. In this article we introduce a meta-structure that can have unlimited depth and a custom, user-defined combination of nested structures, such as grids, quadtrees, octrees, or kd-trees. With our approach, the out-of-core indexing of point clouds can be adapted to different types of datasets, taking into account the spatial distribution of the data. Therefore, the most suitable spatial indexing can be achieved for any type of dataset, from small TLS-based scenes to planetary-scale ALS-based scenes. This approach allows us to work with overlapping datasets of different resolutions from different acquisition technologies in the same structure.

关键词： spatial data structure spatial big data Ubiquitous Point Cloud LiDAR

来源：评论

学校读者我要写书评

暂无评论

Combinatorial and asymptotic results on the neighborhood grid

引用

DISCRETE APPLIED MATHEMATICS 2025年 372卷 48-64页

作者： McDonough, Alex Reitebuch, Ulrich Skrodzki, Martin Univ Oregon Eugene OR USA FU Berlin Math & Comp Sci Berlin Germany Delft Univ Technol Comp Graph & Visualizat Delft Netherlands

In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various such data structures have been developed, one being the neighborhood grid. In this paper, we consider combinatorial aspects of this data structure. Particularly, we show that an assumption on uniqueness, made in previous works, is not actually satisfied. We extend the notions of the neighborhood grid to arbitrary grid sizes and dimensions and provide two alternative, correct versions of the proof that was broken by the dissatisfied assumption. Furthermore, we explore both the uniqueness of certain states of the data structure as well as when the number of these states is maximized. We provide a partial classification by using the hook-length formula for rectangular Young tableaux. Finally, we conjecture how to extend this to all 2-dimensional cases. (c) 2025 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Neighborhood grid Uniqueness Asymptotic Young tableaux spatial data structure

来源：评论

学校读者我要写书评

暂无评论

An efficient update algorithm for spatial data structures managing moving objects

An efficient update algorithm for spatial data structures ma...

引用

4th International Conference on Cybernetics and Information Technologies, Systems and Applications/5th Int Conf on Computing, Communications and Control Technologies

作者： Dekihara, Hiroyuki Nakamura, Yasuaki Hiroshima Int Univ Dept Informat Technol 5-1-1 Hiro Koshingai Kure Hiroshima 7370012 Japan TTT Co Ltd Toshima Ku Tokyo 1700005 Japan Japan Data & Commun Res Inst Minato Ku Tokyo Japan

ISBN: (纸本)9781934272077

In the fields of GIS (Geographic Information System), ITS (Intelligent Transportation System), monitoring systems, and so forth, the spatial data structures for the management of moving objects are very important. Moving objects may change their attributes: location, direction, condition, etc. Therefore, the spatial data structure must manage moving objects efficiently to perform queries that search or trace the spatial data any, time. However, when the data structure is updated at every unit time, the update cost will highly increase. In this paper, an efficient update algorithm for spatial data structures managing moving objects, called the SBUA (the Simplified Batch Updating Algorithm) is proposed. The novel concepts of the SBUA are a botch insertion using a buffer array, and a simplified restructuring according to the location changes of objects. The SBUA saves the update cost of the tree by using the buffer array in which reported new locations of the moving objects are stored. Moreover, the search performances of the SBUA are kept althought the restructuring of the tree is not performed completely.

关键词： spatial data structure moving objects MD-tree

来源：评论

学校读者我要写书评

暂无评论

A metric for spatial data layers in favorability mapping for geological events

引用

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 1999年第3期37卷 1194-1198页

作者： Lu, PF An, P Microsoft Corp Redmond WA 98052 USA Schlumberger GeoQuest Syst Houston TX 77056 USA

In this paper, we present a new metric for quantifying the information content of a categorical data layer with respect to a selected prediction target. When the data layer is used in a favorability prediction, its metric value indicates the amount of contribution the data layer can make to the prediction capability of the model. A small metric value normally means the layer contributes little to the prediction task. Given a data layer in the form of a categorical map, me define the metric as an average ranking measure among all known target occurrence locations, where the ranking measure is defined for the classes in the categorical map based on their relative favorabilities. Two independent sets of past known occurrence data are used in defining the metric: one as a training set to define favorabilities for ranking the classes, and the other as an evaluation set to define the metric. The metric is tested on a real data set in a study of predicting landslides. The calculated metric values for the data layers agree with observations as well as with other theories.

关键词： correlation geographic information system geologic measurements geophysical measurements prediction methods spatial data structure

来源：评论

学校读者我要写书评

暂无评论

spatial data Topology in GIS database

Spatial Data Topology in GIS Database

引用

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Sun, Yunpeng Liaoning Normal Univ 2 Coll City & Environm Tangshan Teachers Coll Dalian Peoples R China

ISBN: (纸本)9783037853191

Topology and its various benefits and functionality are fairly well understood within the context of 2D Geographical Information Systems. We summarize the principle of common 2D topology and the implementation of GIS databases. Existing topological frameworks and data models as a staring point to guide the review process, three key areas were studied for the purposes of requirements identification, namely existing 2D topological systems. However requirements in 3D have yet to be defined, with factors such as lack of familiarity with the potential of such functionality of 3D systems impeding this process. In this paper, we identify and review the requirements for topology in three-dimensional (3D) applications. Requirements for topological functionality in 3D were then grouped and categorized.

关键词： Topology GIS database spatial data structure

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：