Spatial geometric constraint solving based on k-connected graph decomposition

Authors:
Gui-Fang Zhang;Xiao-Shan Gao
Affiliations:
Beijing Forestry University, Beijing, China;Institute of Systems Science, Academia Sinica, Beijing, China
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 6
Cited 3

Algebraic solution for geometry from dimensional constraints

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Handbook of theoretical computer science (vol. A): algorithms and complexity

Handbook of theoretical computer science (vol. A): algorithms and complexity
A graph-constructive approach to solving systems of geometric constraints

ACM Transactions on Graphics (TOG)
Decomposition plans for geometric constraint problems, part II: new algorithms

Journal of Symbolic Computation
Revisiting decomposition analysis of geometric constraint graphs

Proceedings of the seventh ACM symposium on Solid modeling and applications
Geometric constraint solving via C-tree decomposition

SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications

Geometric constraints solving: some tracks

Proceedings of the 2006 ACM symposium on Solid and physical modeling
A New Property of Hamming Graphs and Mesh of d-ary Trees

Computer Mathematics
A 2D geometric constraint solver using a graph reduction method

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 bi-connected or tri-connected graph respectively. Based on this analysis, problems similar to the "double banana problem" could be easily detected.