A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Solving geometric constraints by iterative projections and backprojections
2004
IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004
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
doi:10.1109/robot.2004.1308083
dblp:conf/icra/Thomas04
fatcat:yswb5it3cjdmnn7gwcf3i3afui