LI Yan-Tao, HU Shi-Min, SUN Jia-Guang. A New Decomposition Algorithm of Geometric Constraints Satisfaction ProblemJ. Journal of Computer-Aided Design & Computer Graphics, 2000, 12(12): 926-930.
Citation:
LI Yan-Tao, HU Shi-Min, SUN Jia-Guang. A New Decomposition Algorithm of Geometric Constraints Satisfaction ProblemJ. Journal of Computer-Aided Design & Computer Graphics, 2000, 12(12): 926-930.
LI Yan-Tao, HU Shi-Min, SUN Jia-Guang. A New Decomposition Algorithm of Geometric Constraints Satisfaction ProblemJ. Journal of Computer-Aided Design & Computer Graphics, 2000, 12(12): 926-930.
Citation:
LI Yan-Tao, HU Shi-Min, SUN Jia-Guang. A New Decomposition Algorithm of Geometric Constraints Satisfaction ProblemJ. Journal of Computer-Aided Design & Computer Graphics, 2000, 12(12): 926-930.
A New Decomposition Algorithm of Geometric Constraints Satisfaction Problem
Solving geometric constraints is a key issue of parametric design. In this paper, an algorithm for decomposing the declarative constraint system is described. The space and time complexity of this algorithm is O(n) and O(n2), respectively. And it has been implemented in a CAD commercial product GH MDS.
DownLoad: