Implementation and parallelization of a reverse-search algorithm for Minkowski sums

DOI10.1137/1.9781611972900.4MaRDI QIDQ5233592zbMATH OpenOpenAlexFDO

Authors Christophe Weibel

Publication date 11 September 2019

Published in 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972900.4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10)

Recommendations

• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Improvements to algorithms for computing the Minkowski sum of 3-polytopes
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces

Cited in

(7)

• scientific article; zbMATH DE number 742981 (Why is no real title available?)
• REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS
• Non-perturbative geometries for planar \(\mathcal{N} = 4\) SYM amplitudes
• Practical volume estimation of zonotopes by a new annealing schedule for cooling convex bodies
• Dynamic learning and decision making via basis weight vectors
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Parallel enumeration of triangulations

Describes a project that uses

Uses Software

• Minksum

This page was built for publication: Implementation and parallelization of a reverse-search algorithm for Minkowski sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233592)