An Optimal Method of Bipartite Graph Matching for Underconstrained Geometry Solving
Chen Li · Chinese Journal of Computers · 2000
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.