Reduction of time complexity of algorithms for fractal dimension calculation of 3D point-like structures
Abstract
The methods for fractal dimension calculation of 3D point-like structures are considered. Estimates of time complexity of algorithms and run time of programs are made. Modifications of algorithms to reduce the time complexity and scheme of parallelism of programs to decrease the run time are suggested.
Published
2004-10-20
How to Cite
Dekhanbaev, D. (2004). Reduction of time complexity of algorithms for fractal dimension calculation of 3D point-like structures. Information and Control Systems, (5), 7-12. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14475
Issue
Section
Hardware and software resources