一种面向欠约束几何系统求解的二部图匹配优化处理方法

An Optimal Method of Bipartite Graph Matching for Underconstrained Geometry Solving

针对一般几何约束系统欠约束状态下约束分解的多样性 ,对相应的有向图强连通子图提出了进一步分解的二部图匹配优化处理策略 ,并给出了主要算法 ,最终实现了欠约束系统的优化分解 ,有利于一般几何约束系统的快速求解 .

A set of algorithms are presented in this paper, which deal with constraint decomposition of underconstrained geometry. In these algorithms, an optimal processing method of bipartite graph matching is proposed which has advantages of further decomposition of the relative strong component of direct graph. Finally, an optimal decomposition is realized in general underconstrained geometry solving. It is good for fast solving of general geometry constraint system.