Labelling 2-D geometric primitives using probabilistic relaxation: reducing the computational requirements

In previous work, an algorithm for matching geometric features was developed. Although the method worked well, it was demanding in computational resources when applied to large problems. The authors now present methods for reducing the computational requirements, without significantly affecting the reliability of the algorithm