Minkowski Sum Computation

Minkowski Sum Computation is a mathematical operation in solid modeling that combines two geometric sets by translating one set along all points of the other, thereby generating a composite shape that represents the union of all such translations.

139

Publications

5.4K

Citations

247

Authors

142

Institutions

Publications per year

2017–2026

24

Authors

247

  1. DH
    Dan Halperin

    Tel Aviv University, Israel

    6 publications · 303 citations

    6

    h-index

  2. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    6 publications · 563 citations

    6

    h-index

  3. JL
    Jyh‐Ming Lien

    George Mason University, United States

    5 publications · 107 citations

    5

    h-index

  4. CW
    Christophe Weibel

    Dartmouth College, United States

    5 publications · 139 citations

    5

    h-index

  5. EF
    Efi Fogel

    Tel Aviv University, Israel

    4 publications · 133 citations

    4

    h-index

1–5 of 247

Venues

  1. Computer-Aided Design

    12 publications · 359 citations

    11

    h-index

  2. Discrete & Computational Geometry

    7 publications · 272 citations

    7

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 76 citations

    4

    h-index

  4. Computational Geometry

    3 publications · 228 citations

    3

    h-index

  5. Journal of High Energy Physics

    JHEP · 3 publications · 86 citations

    3

    h-index

1–5