32 search results - page 1 / 7 » Geometric constraint solving via C-tree decomposition |
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...
CAD
2006
Springer
13 years 5 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...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
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...
FAC
2010
13 years 3 months ago
2010
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...