The Community for Technology Leaders
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2005)
Timisoara, Romania
Sept. 25, 2005 to Sept. 29, 2005
ISBN: 0-7695-2453-2
pp: 52-55
Xinli Zhang , Chengdu University of Information Technology
Dayong Zhu , University of Electronic Science and Technology of China
ABSTRACT
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.
INDEX TERMS
null
CITATION
Xinli Zhang, Dayong Zhu, "A Connectivity Analysis Approach in Geometric Constraint Solving", 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, vol. 00, no. , pp. 52-55, 2005, doi:10.1109/SYNASC.2005.2
81 ms
(Ver 3.3 (11022016))