Sciweavers

1071 search results - page 2 / 215
» Solving Geometric Constraint Systems
Sort
View
FAC
2010
105views more  FAC 2010»
13 years 3 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
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
13 years 10 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
AIEDAM
2006
95views more  AIEDAM 2006»
13 years 5 months ago
Constraint solving for direct manipulation of features
In current commercial feature modeling systems, support for direct manipulation of features is not commonly available. This is partly due to the strong reliance of such systems on...
Daniel Lourenço, Pedro Oliveira, Alex Noort...
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
13 years 11 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort
CAD
1999
Springer
13 years 4 months ago
Geometric constraint satisfaction using optimization methods
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao