Sciweavers

3 search results - page 1 / 1
» Swept Volume approximation of polygon soups
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
13 years 11 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
CGF
2010
146views more  CGF 2010»
13 years 4 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
13 years 9 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...