A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
Author:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 401-415
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex PiecesLecture Notes in Computer Science, 2007
- Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications2006
- From the zonotope construction to the Minkowski addition of convex polytopesJournal of Symbolic Computation, 2004
- Polygon Decomposition for Efficient Construction of Minkowski SumsLecture Notes in Computer Science, 2000
- OBBTree1996
- A unified computational framework for Minkowski operationsComputers & Graphics, 1993
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner BasesSIAM Journal on Discrete Mathematics, 1993
- Convex Decomposition of Polyhedra and RobustnessSIAM Journal on Computing, 1992
- Computing convolutions by reciprocal searchDiscrete & Computational Geometry, 1987
- A kinetic framework for computational geometry1983