Sciweavers

11 search results - page 2 / 3
» A C-tree decomposition algorithm for 2D and 3D geometric con...
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
13 years 11 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
RT
1998
Springer
13 years 9 months ago
Interactively Modeling with Photogrammetry
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...
CVPR
2010
IEEE
14 years 1 months ago
Relaxing the 3L algorithm for an accurate implicit polynomial fitting
This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty l...
Mohammad Rouhani and Angel D. Sappa
CVPR
2004
IEEE
14 years 7 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
ISBI
2004
IEEE
14 years 6 months ago
Volumetric Harmonic Brain Mapping
Brain surface conformal mapping research has been successful and this motivates our more general investigation of 3D volumetric brain harmonic mapping. By transforming the full 3D...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. Tho...