权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Modeling and Data Structures for Spatio^temporal Objects Changing Their Positions and Shapes

时空对象改变其位置和形状的建模和数据结构

基本信息

批准号：
14580388
负责人：
NAKAMURA Yasuaki
金额：
$ 2.24万
依托单位：
Hiroshima City University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2002
资助国家：
日本
起止时间：
2002 至 2003
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-14580388/
关键词：
Spatio-temporal Data spatial Data Structure Spatial Queries Database Geographic Information System Tree Structure Moving Object Version Management

项目摘要

In the engineering database system, multiple versions of a design including engineering drawings should be managed efficiently. We developed efficient spatial data structures, that are expansions of the R-tree and HR-tree, for version management of engineering drawings.A novel mechanism to manage the difference between drawings is introduced to the HR-tree to eliminate redundant duplications and to reduce the amount of storage required for the data structure. Data management mechanism and structural properties of our data structure called the MVR+-tree are described. To man age, the moving objects efficiently, the PMD-tree was developed. The PMD-tree is an extension of our data structure called the MD-tree that can access any past states of the data set as well as the present state of the data set. The search efficiencies are almost the same as the MD-tree. For geometric data with a network structure, data compression methods have been proposed. These methods can be applied to the map … More data, power networks, or other graph structures to compress the amount of storage. For an acquisition of 3D geometric data from images, we propose a new range finder method that can obtain the 3D structure and illumination properties at the same time. The method In the engineering database system, multiple versions of a design including engineering drawings should be managed efficiently. We developed efficient spatial data structures, that are expansions of the R-tree and HR-tree, for version management of engineering drawings.A novel mechanism to manage the difference between drawings is introduced to the HR-tree to eliminate redundant duplications and to reduce the amount of storage required for the data structure. Data management mechanism and structural properties of our data structure called the MVR+-tree are described. To man age the moving objects efficiently, the PMD-tree was developed. The PMD-tree is an extension of our data structure called the MD-tree that can access any past states of the data set as well as the present state of the data set. The search efficiencies are almost the same as the MD-tree. For geometric data with a network structure, data compression methods have been proposed. These methods can be applied to the map data, power networks, or other graph structures to compress the amount of st6rage. For an acquisition of 3D geometric data from images, we propose a new range finder method that can obtain the 3D structure and illumination properties at the same time. The method can construct the 3D model of an actual object automatically. Less

在工程数据库系统中，需要对包括工程图纸在内的多个版本的设计进行有效的管理。我们开发了高效的空间数据结构，这是r树和hr树的扩展，用于工程图纸的版本管理。在hr树中引入了一种新的机制来管理图纸之间的差异，以消除冗余重复并减少数据结构所需的存储量。介绍了数据管理机制和数据结构MVR+树的结构特性。为了有效地对运动目标进行分类，提出了pmd树。pmd树是我们的数据结构MD-tree的扩展，它可以访问数据集的任何过去状态以及数据集的当前状态。搜索效率几乎与md树相同。对于具有网络结构的几何数据，提出了数据压缩方法。这些方法可以应用于更多的数据、电网或其他图形结构来压缩存储量。为了从图像中获取三维几何数据，我们提出了一种能够同时获取图像三维结构和光照特性的测距方法。在工程数据库系统中，需要对包括工程图纸在内的多个版本的设计进行有效的管理。我们开发了高效的空间数据结构，这是r树和hr树的扩展，用于工程图纸的版本管理。在hr树中引入了一种新的机制来管理图纸之间的差异，以消除冗余重复并减少数据结构所需的存储量。介绍了数据管理机制和数据结构MVR+树的结构特性。为了有效地管理运动目标，提出了pmd树。pmd树是我们的数据结构MD-tree的扩展，它可以访问数据集的任何过去状态以及数据集的当前状态。搜索效率几乎与md树相同。对于具有网络结构的几何数据，提出了数据压缩方法。这些方法可以应用于地图数据、电网或其他图形结构，以压缩存储容量。为了从图像中获取三维几何数据，我们提出了一种能够同时获取图像三维结构和光照特性的测距方法。该方法可以自动构建实际物体的三维模型。少