115 search results - page 1 / 23 » Numerical decomposition of geometric constraints |
SMA
2005
ACM
13 years 10 months ago
2005
ACM
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...
IV
2002
IEEE
13 years 9 months ago
2002
IEEE
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
IJCGA
2006
13 years 4 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
CAD
2006
Springer
13 years 4 months ago
2006
Springer
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...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...