An optimal method of bipartite graph matching for under-constrained geometry solving

摘要

A set of algorithms is presented in this paper, which deals with constraint decomposition of under-constrained 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, the optimal decomposition is realized in the general under-constrained geometry solving. It is good for fast solving of the general geometry constraint system.