在空间数据库系统Hawk Eye上实现了基于关联图的单元复数二进制空间运算

K. Kaneko, A. Makinouchi
{"title":"在空间数据库系统Hawk Eye上实现了基于关联图的单元复数二进制空间运算","authors":"K. Kaneko, A. Makinouchi","doi":"10.2201/NIIPI.2006.3.3","DOIUrl":null,"url":null,"abstract":"We implemented a spatial database system called Hawk Eye for three- and four-dimensional modeling applications, such as solid modeling, computer simulation and computer vision. Spatial query and manipulation are important system functions for retrieving and analyzing spatial objects. Binary spatial operations are necessary in order to respond to spatial queries and manipulations. Efficient processing of binary spatial operations between two cell complexes is important with respect to a cell-complex-based spatia ld atabase because the evaluation of these operations by previous algorithms is time-consuming. We present a new algorithm called the Cell Splitting and Merge Algorithm (CSMA) to evaluate binary spatial operations between two cell complexes. The ne wa lgorithm is efficient for cell complexes of three or four dimensions. Key to the algorithm is the use of an incidence graph of the cell complex.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"13 41 1","pages":"19"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Binary spatial operations on cell complex using incidence graph implemented at a spatial database system Hawk Eye\",\"authors\":\"K. Kaneko, A. Makinouchi\",\"doi\":\"10.2201/NIIPI.2006.3.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We implemented a spatial database system called Hawk Eye for three- and four-dimensional modeling applications, such as solid modeling, computer simulation and computer vision. Spatial query and manipulation are important system functions for retrieving and analyzing spatial objects. Binary spatial operations are necessary in order to respond to spatial queries and manipulations. Efficient processing of binary spatial operations between two cell complexes is important with respect to a cell-complex-based spatia ld atabase because the evaluation of these operations by previous algorithms is time-consuming. We present a new algorithm called the Cell Splitting and Merge Algorithm (CSMA) to evaluate binary spatial operations between two cell complexes. The ne wa lgorithm is efficient for cell complexes of three or four dimensions. Key to the algorithm is the use of an incidence graph of the cell complex.\",\"PeriodicalId\":91638,\"journal\":{\"name\":\"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing\",\"volume\":\"13 41 1\",\"pages\":\"19\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2201/NIIPI.2006.3.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2201/NIIPI.2006.3.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们实现了一个名为Hawk Eye的空间数据库系统,用于三维和四维建模应用,如实体建模、计算机仿真和计算机视觉。空间查询和操作是检索和分析空间对象的重要系统功能。为了响应空间查询和操作,二进制空间操作是必要的。对于基于细胞复合体的空间数据库来说,有效地处理两个细胞复合体之间的二进制空间运算是很重要的,因为以前的算法对这些运算的评估是耗时的。我们提出了一种新的算法,称为细胞分裂和合并算法(CSMA)来评估两个细胞复合体之间的二进制空间操作。该算法对于三维或四维的细胞复合体是有效的。该算法的关键是使用了细胞复合体的关联图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Binary spatial operations on cell complex using incidence graph implemented at a spatial database system Hawk Eye
We implemented a spatial database system called Hawk Eye for three- and four-dimensional modeling applications, such as solid modeling, computer simulation and computer vision. Spatial query and manipulation are important system functions for retrieving and analyzing spatial objects. Binary spatial operations are necessary in order to respond to spatial queries and manipulations. Efficient processing of binary spatial operations between two cell complexes is important with respect to a cell-complex-based spatia ld atabase because the evaluation of these operations by previous algorithms is time-consuming. We present a new algorithm called the Cell Splitting and Merge Algorithm (CSMA) to evaluate binary spatial operations between two cell complexes. The ne wa lgorithm is efficient for cell complexes of three or four dimensions. Key to the algorithm is the use of an incidence graph of the cell complex.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信