Abstract: Locus intersection method for geometric constraint solving is presented,which can be used to find all numerical solutions for a constraint problem efficiently.To simulate a complex linkage dynamically,we first use the maximal b-matching algorithm from graph theory to decompose the linkage into smaller components and then use the locus intersection method to find the solutions.