|
Volumn 2073, Issue , 2001, Pages 619-628
|
An efficient algorithm to calculate the minkowski sum of convex 3D polyhedra
|
Author keywords
[No Author keywords available]
|
Indexed keywords
GEOMETRY;
GRAPH STRUCTURES;
GRAPHIC METHODS;
AS GRAPH;
ATTRIBUTED GRAPHS;
CONVEX POLYHEDRONS;
MINKOWSKI SUM;
RUNNING TIME;
GRAPH ALGORITHMS;
|
EID: 23044526476
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-45545-0_71 Document Type: Conference Paper |
Times cited : (20)
|
References (10)
|