REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS

Abstract

To calculate the Minkowski-sum based similarity measure of two convex polyhedra, many relative orientations have to be considered. These relative orientations are characterized by the fact that some faces and edges of the polyhedra are parallel. For every relative orientation of the polyhedra, the volume or mixed volume of their Minkowski sum is evaluated. From the minimum of this volume, the similarity measure is calculated. In this article two issues are addressed. First, we propose and test a method to reduce the set of relative orientations to be considered by using geometric inequalities in the slope diagrams of the polyhedra. In this way, the time complexity of O(n6) is reduced to O(n4.5). Secondly, we determine which relative orientation problems are ill-posed and may be skipped because they do not maximize the similarity measure.