{"title":"Algorithm for constructing three-dimensional Barcodes to represent nD spatial objects in GIS","authors":"D. Andrianov, S. Eremeev, Y. Kovalev","doi":"10.18287/1613-0073-2019-2391-206-210","DOIUrl":null,"url":null,"abstract":"The article describes the algorithm for creating three-dimensional Barcodes to represent nD features. The algorithm is based on computer topology methods using the 3D sweep hull algorithm for computing convex hulls and Delaunay triangulation. The result of the algorithm are 3D Barcodes of features. 3D Barcode graphs were built that reflect their time differences. The algorithm for constructing 3D Barcodes will allow analyzing spatial nD objects at different time intervals.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18287/1613-0073-2019-2391-206-210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The article describes the algorithm for creating three-dimensional Barcodes to represent nD features. The algorithm is based on computer topology methods using the 3D sweep hull algorithm for computing convex hulls and Delaunay triangulation. The result of the algorithm are 3D Barcodes of features. 3D Barcode graphs were built that reflect their time differences. The algorithm for constructing 3D Barcodes will allow analyzing spatial nD objects at different time intervals.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
