Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) (2005)
Sept. 25, 2005 to Sept. 29, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.2
Xinli Zhang , Chengdu University of Information Technology
Dayong Zhu , University of Electronic Science and Technology of China
In this paper, we analyze the relationship between the structurally geometric well-constrained graphs and the complete graphs firstly. Then we propose the base configurations in 2D and 3D which are based on these relationships. After that, we present the property which the minimal cut graphs of structurally well-constrained graphs satisfy with, than obtain the lower limit of connectivity of structurally well-constrained graphs. Finally, we propose a method which can be used to generate the connectivity and the separating k-tuple of a geometric constrained graph.
X. Zhang and D. Zhu, "A Connectivity Analysis Approach in Geometric Constraint Solving," Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)(SYNASC), Timisoara, Romania, 2005, pp. 52-55.