Sciweavers

24 search results - page 3 / 5
» The Convex Hull of Freeform Surfaces
Sort
View
VMV
2008
151views Visualization» more  VMV 2008»
13 years 7 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
CGF
2008
128views more  CGF 2008»
13 years 5 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...
IJCV
2006
194views more  IJCV 2006»
13 years 5 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
CA
1996
IEEE
13 years 10 months ago
Efficient And Accurate Interference Detection For Polynomial Deformation
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
Merlin Hughes, Christopher DiMattia, Ming C. Lin, ...
CORR
2004
Springer
102views Education» more  CORR 2004»
13 years 5 months ago
Unfolding Smooth Primsatoids
Nadia Benbernou Patricia Cahn Joseph O'Rourke We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth ...
Nadia Benbernou, Patricia Cahn, Joseph O'Rourke