{"title":"基于web的大规模三维场景空间数据结构的改进","authors":"Jiaxi Chen, Wei Fang","doi":"10.1109/ICSESS47205.2019.9040768","DOIUrl":null,"url":null,"abstract":"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 R* -tree and the octree 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.","PeriodicalId":203944,"journal":{"name":"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Spatial Data Structure for Web-based Large-scale 3D Scene\",\"authors\":\"Jiaxi Chen, Wei Fang\",\"doi\":\"10.1109/ICSESS47205.2019.9040768\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 R* -tree and the octree 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.\",\"PeriodicalId\":203944,\"journal\":{\"name\":\"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS47205.2019.9040768\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS47205.2019.9040768","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Spatial Data Structure for Web-based Large-scale 3D Scene
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 R* -tree and the octree 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.