{"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}
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.