Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Close-to-optimal algorithm for rectangular decomposition of 3D shapes

Cyril Höschl IVJan Flusser — 2019

Kybernetika

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 sub-optimal polynomial heuristic approximation, which transforms the decomposition problem onto a graph-theoretical problem. We compare its performance with the state of the art Octree and Delta methods. We show by extensive experiments...

Page 1

Download Results (CSV)