{"title":"CAD数据库中工程图纸版本管理的空间数据结构","authors":"Yasuaki Nakamura, H. Dekihara","doi":"10.1109/ICIAP.2003.1234053","DOIUrl":null,"url":null,"abstract":"In the engineering database system, multiple versions of a design, including engineering drawings, should be managed efficiently. Spatial data structures can manage spatial objects in a drawing efficiently. The paper proposes extended spatial data structures 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. Extended data structures of the R-tree, called 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.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Spatial data structures for version management of engineering drawings in CAD database\",\"authors\":\"Yasuaki Nakamura, H. Dekihara\",\"doi\":\"10.1109/ICIAP.2003.1234053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the engineering database system, multiple versions of a design, including engineering drawings, should be managed efficiently. Spatial data structures can manage spatial objects in a drawing efficiently. The paper proposes extended spatial data structures 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. Extended data structures of the R-tree, called 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.\",\"PeriodicalId\":218076,\"journal\":{\"name\":\"12th International Conference on Image Analysis and Processing, 2003.Proceedings.\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th International Conference on Image Analysis and Processing, 2003.Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAP.2003.1234053\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAP.2003.1234053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spatial data structures for version management of engineering drawings in CAD database
In the engineering database system, multiple versions of a design, including engineering drawings, should be managed efficiently. Spatial data structures can manage spatial objects in a drawing efficiently. The paper proposes extended spatial data structures 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. Extended data structures of the R-tree, called 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.