Minkowski Sums

Minkowski Sums is a binary operation on subsets of a vector space that, given two convex sets, yields the set of all vector sums of points from each set, thereby forming a fundamental construct in convex geometry and analysis.

139

Publications

5.5K

Citations

213

Authors

129

Institutions

Publications per year

2017–2026

19

Variants

Minkowski Addition

Authors

213

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    6 publications · 212 citations

    6

    h-index

  2. DH
    Dan Halperin

    Tel Aviv University, Israel

    6 publications · 303 citations

    6

    h-index

  3. JL
    Jyh‐Ming Lien

    George Mason University, United States

    5 publications · 127 citations

    5

    h-index

  4. CW
    Christophe Weibel

    Dartmouth College, United States

    5 publications · 139 citations

    5

    h-index

  5. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    5 publications · 386 citations

    5

    h-index

1–5 of 213

Venues

  1. Computer-Aided Design

    11 publications · 311 citations

    11

    h-index

  2. Discrete & Computational Geometry

    8 publications · 289 citations

    8

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 3 publications · 129 citations

    3

    h-index

  4. 3

    h-index

  5. Graphical Models

    3 publications · 201 citations

    3

    h-index

1–5