Loading [a11y]/accessibility-menu.js
A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection | IEEE Journals & Magazine | IEEE Xplore

A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection


Abstract:

This article provides an extensive review of algorithms for constructing Minkowski sums and differences of polygons and polyhedra, both convex and non-convex, commonly kn...Show More

Abstract:

This article provides an extensive review of algorithms for constructing Minkowski sums and differences of polygons and polyhedra, both convex and non-convex, commonly known as no-fit polygons and configuration space obstacles. The Minkowski difference is a set operation, which when applied to shapes defines a method for efficient overlap detection, providing an important tool in packing and motion-planning problems. This is the first complete review on this specific topic, and aims to unify algorithms spread over the literature of separate disciplines.
Published in: IEEE Transactions on Visualization and Computer Graphics ( Volume: 27, Issue: 8, 01 August 2021)
Page(s): 3377 - 3396
Date of Publication: 28 February 2020

ISSN Information:

PubMed ID: 32142441

References

References is not available for this document.