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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
