A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon decomposition for efficient construction of Minkowski sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive results on convex hulls, extreme points, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal convex hull algorithm in any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the zonotope construction to the Minkowski addition of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of faces of the Minkowski sum of two convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal f-vectors of Minkowski sums of large numbers of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method / rank
 
Normal rank

Latest revision as of 10:35, 28 July 2024

scientific article
Language Label Description Also known as
English
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
scientific article

    Statements

    A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2022
    0 references

    Identifiers