An attempt to recognize 3-D objects by forward checking constrained tree search is described. The method checks geometric constraints between the current partial matching pairs and remaining possible pairs and drastically reduces the search space. Furthermore, it yields powerful search termination criteria.