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
139
Fast distance queries with rectangular swept sphere volumes
Eric Larsen, S. Gottschalk, Ming C. Lin et al. · 2002 · 277 citations
Combinatorial Properties of Associated Zonotopes
G. C. Shephard · Canadian Journal of Mathematics · 1974 · 163 citations · Full text
Alex A. Kurzhanskiy, Pravin Varaiya · 2006 · 154 citations
1–5 of 139
247
6
h-index
University of North Carolina at Chapel Hill, United States
6 publications · 563 citations
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 247
142

Centre National de la Recherche Scientifique
Paris, France
7 h-index
17 publications
415 citations
University of California, Berkeley
Berkeley, United States
7 h-index
11 publications
627 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
10 publications
582 citations
George Mason University
Fairfax, United States
5 h-index
9 publications
143 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
5 h-index
12 publications
924 citations
Université de Bordeaux
Bordeaux, France
3 h-index
5 publications
133 citations
IBM (United States)
Armonk, United States
3 h-index
5 publications
206 citations
Dalian University of Technology
Dalian, China
3 h-index
10 publications
354 citations
1–8 of 142
12 publications · 359 citations
11
h-index
7 publications · 272 citations
7
h-index
Repository · 4 publications · 76 citations
4
h-index
3 publications · 228 citations
3
h-index
JHEP · 3 publications · 86 citations
3
h-index
1–5