Sciweavers

Share
SAC
2006
ACM

Spatial geometric constraint solving based on k-connected graph decomposition

9 years 1 months ago
Spatial geometric constraint solving based on k-connected graph decomposition
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 if possible. We also show how to merge two rigid bodies if they share two or three geometric primitives in a biconnected or tri-connected graph respectively. Based on this analysis, problems similar to the “double banana problem” could be easily detected. Categories and Subject Descriptors J.6 [COMPUTER-AIDED ENGINEERING]: CAD Keywords Geometric constraint solving, parametric CAD, k-connected graph, separating k-tuple, decomposition
Gui-Fang Zhang, Xiao-Shan Gao
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SAC
Authors Gui-Fang Zhang, Xiao-Shan Gao
Comments (0)
books