Solving geometric constraint systems in 3-D is much more complicated than that in 2-D because the number of variables is larger and some of the results valid in 2-D cannot be extended for 3-D. In this paper, we propose a new DOF based graph constructive method to geometric constraint systems solving that can efficiently handle well-, over-and under-constrained systems based on the dependence analysis. Tile basic idea is that the solutions of some geometric elements depend on some others because of the constraints between them. if some geometric elements depend on each other, they must be solved together, in our approach, we first identify all structurally redundant constraints, then we add some constraints to well constrain the system. And we prove that the order of a constraint system after processing-under constrained cases is not more than that of the original system multiplied by 5. After that, we apply a recursive searching process to identify all the clusters, which is shown to be capable of getting the mimimum order-reduction result of a well constrained system. We also briefly describe tile constraint evaluation phase and show the implementation results of our method.