Name
Abstract | ||
|---|---|---|
We provide an analytical description of the Minkowski sum of simplices in R+3. The convex polytope is determined by the coordinates of facets' vertices, may the polytope be degenerate or not. The pre-established description of the polytope allows a rapid implementation using popular applications, here achieved using Matlab®. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.comgeo.2014.04.002 | Computational Geometry |
Keywords | Field | DocType |
Minkowski sum of simplices,Simplices,Polytope | Discrete mathematics,Gilbert–Johnson–Keerthi distance algorithm,Birkhoff polytope,Combinatorics,Vertex (geometry),Uniform k 21 polytope,Convex polytope,Polytope,Cross-polytope,Minkowski addition,Mathematics | Journal |
Volume | Issue | ISSN |
47 | 8 | 0925-7721 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-paul Bourrières | 1 | 8 | 3.06 |