Sciweavers

1682 search results - page 144 / 337
» Variational Constraints in 3D
Sort
View
SIAMJO
2000
56views more  SIAMJO 2000»
13 years 10 months ago
Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
Abstract. Many variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied...
Roberto Andreani, José Mario Martíne...
CVPR
2001
IEEE
15 years 5 days ago
Diffusion Tensor Regularization with Constraints Preservation
This paper deals with the problem of regularizing noisy fields of diffusion tensors, considered as symmetric and semi-positive definite ? ? ? matrices (as for instance 2D structur...
David Tschumperlé, Rachid Deriche
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 3 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...
CAD
2004
Springer
13 years 10 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
PRL
2008
122views more  PRL 2008»
13 years 9 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu