Sciweavers

1483 search results - page 31 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
SMA
2005
ACM
151views Solid Modeling» more  SMA 2005»
14 years 4 months ago
A constructive approach to calculate parameter ranges for systems of geometric constraints
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such...
Hilderick A. van der Meiden, Willem F. Bronsvoort
FAC
2010
105views more  FAC 2010»
13 years 9 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
CAD
2006
Springer
13 years 11 months ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang
ECCV
2010
Springer
14 years 2 months ago
Practical Methods For Convex Multi-View Reconstruction
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
EVOW
2006
Springer
14 years 2 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...