loading...
A Connectivity Analysis Approach in Geometric Constraint Solving
Timisoara, Romania September 25-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.2Seventh International Symposium on Sy ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Xinli Zhang, Dayong Zhu, "A Connectivity Analysis Approach in Geometric Constraint Solving," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 52-55, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SYNASC.2005.2,
author = {Xinli Zhang and Dayong Zhu},
title = {A Connectivity Analysis Approach in Geometric Constraint Solving},
journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2453-2},
pages = {52-55},
doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.2},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
TI - A Connectivity Analysis Approach in Geometric Constraint Solving
SN - 0-7695-2453-2
SP52
EP55
A1 - Xinli Zhang,
A1 - Dayong Zhu,
PY - 2005
KW - null
VL - 0
JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
ER -
 
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.
Citation:
Xinli Zhang, Dayong Zhu, "A Connectivity Analysis Approach in Geometric Constraint Solving," synasc, pp.52-55, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions