Abstract — Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves geometric constraint systems by iteratively reducing and expanding the dimension of the problem. In general, these projection/backprojection iterations permit tightening the ranges for the possible solutions but, if at a given point no progress is made, the algorithm bisects the search space and proceeds recursively for both subproblems. This branch-and-prune strategy is shown to converge to all solutions. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.