Sciweavers

70 search results - page 13 / 14
» Origamizing Polyhedral Surfaces
Sort
View
CAD
2006
Springer
13 years 6 months ago
Fast computation of inertia through affinely extended Euler tensor
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
Antonio DiCarlo, Alberto Paoluzzi
TOG
2002
127views more  TOG 2002»
13 years 5 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
BMVC
2010
13 years 4 months ago
Reducing mismatching under time-pressure by reasoning about visibility and occlusion
Three methods are explored which help indicate whether feature points are potentially visible or occluded in the matching phase of the keyframe-based real-time visual SLAM system....
Somkiat Wangsiripitak, David W. Murray
GMP
2006
IEEE
127views Solid Modeling» more  GMP 2006»
14 years 9 days ago
Finding All Undercut-Free Parting Directions for Extrusions
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
Xiaorui Chen, Sara McMains
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
13 years 9 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García