Geometric constraint solving is a growing field which plays a paramount role in industrial applications and that is deeply rooted in automated deduction in geometry. In this work we report on an algorithm to solve geometric constraint-based problems by decomposing biconnected graphs. The algorithm is based on recursively splitting the graph through sets with three vertices located on fundamental circuits of the graph. Preliminary practical experiments suggest that the algorithm runtime is at worst quadratic with the total number of vertices in the graph.