DocumentCode
2269999
Title
Point-Based Minkowski Sum Boundary
Author
Lien, Jyh-Ming
Author_Institution
George Mason Univ., Fairfax
fYear
2007
fDate
Oct. 29 2007-Nov. 2 2007
Firstpage
261
Lastpage
270
Abstract
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to its high computational complexity and several nontrivial implementation issues, computing the exact boundary of the Minkowski sum of two arbitrary polyhedra is generally a difficult task. In this work, we propose to represent the boundary of the Minkowski sum approximately using only points. Our results show that this point-based representation can be generated efficiently. An important feature of our method is its straightforward implementation and parallelization. We also demonstrate that the point-based representation of the Minkowski sum boundary can indeed provide similar functionality as mesh-based representations can. We show several applications in motion planning, penetration depth approximation and modeling.
Keywords
computational complexity; computational geometry; mesh generation; computational complexity; geometric application; mesh generation; motion planning; penetration depth approximation; point-based Minkowski sum boundary; Application software; Computational complexity; Computer graphics; Filters; Robots; Robustness; Solid modeling; Surface morphology; Virtual prototyping; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Graphics and Applications, 2007. PG '07. 15th Pacific Conference on
Conference_Location
Maui, HI
ISSN
1550-4085
Print_ISBN
978-0-7695-3009-3
Type
conf
DOI
10.1109/PG.2007.49
Filename
4392736
Link To Document