0468204 20240103213252.520170103235959.9 85011097258 000391534900037 10.1109/DICTA.2016.7797028 8 s. P cav_un_epca*0468203978-1-5090-2897-9PiscatawayIEEE2016 Algorithm design and analysis Particle separators Image coding cav_un_auth*0282545 Höschl Cyril Zpracování obrazové informace Department of Image Processing ZOI ZOI UTIA-B Department of Image Processing CZ Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101087 Flusser Jan Zpracování obrazové informace Department of Image Processing ZOI ZOI UTIA-B Department of Image Processing Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2016/ZOI/flusser-0468204.pdf cav_un_auth*0314467 GA15-16928S GA ČR In this paper we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks. Theoretically optimal brute-force algorithm is known to be NP-hard and practically infeasible. We introduce its polynomial sub-optimal approximation, which transforms the decomposition problem onto a graph-theoretical problem. We show by extensive experiments that the proposed method outperforms the the octree decomposition in terms of the number of blocks on statistically significant level. We also discuss potential applications of the method in image processing. cav_un_auth*0340227 DICTA 2016 : Digital Image Computing: Techniques and Applications 20161130 20161202 Gold Coast AU JD 2017 2 PR RVO:67985556 http://hdl.handle.net/11104/0266053 1 S 3+4 Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic|Imaging Science Photographic Technology 2016 85011097258 SCOPUS PUBMED 000391534900037 WOS cav_un_epca*0468203 Digital Image Computing: Techniques and Applications (DICTA) 2016 978-1-5090-2897-9 Piscataway IEEE 2016