A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
From MaRDI portal
Publication:831714
DOI10.1007/978-3-030-67899-9_14OpenAlexW3128098595MaRDI QIDQ831714
Sandip Das, Swami Sarvottamananda, Subhadeep Ranjan Dev
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_14
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum number of faces of the Minkowski sum of two convex polytopes
- Maximal f-vectors of Minkowski sums of large numbers of polytopes
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- An optimal convex hull algorithm in any fixed dimension
- Output-sensitive results on convex hulls, extreme points, and related problems
- From the zonotope construction to the Minkowski addition of convex polytopes
- Powers of tensors and fast matrix multiplication
- Convex Polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
- Polygon decomposition for efficient construction of Minkowski sums
