A method is presented to locate a general polyhedron in space with six degrees of freedom. A light stripe sensor is assumed to be capable of providing three-dimensional data points on known edges of the polyhedron to within a known accuracy. A representation is found for all the ways three line segments of fixed length can fall between the edges of a polyhedron. This representation, called an edge interval, is used in a tree search to find the location of each data point to within an interval on the edge. The final location of the object is determined by a one-dimensional line search. The method is illustrated with simulated data from a unit tetrahedron and results from a computer implementation are presented. The tree search takes a negligible amount of time and the one-dimensional line search takes a small additional increment.
[1]
Roger Y. Tsai,et al.
A versatile camera calibration technique for high-accuracy 3D machine vision metrology using off-the-shelf TV cameras and lenses
,
1987,
IEEE J. Robotics Autom..
[2]
S. Gordon,et al.
Locating polyhedral features from sparse light-stripe data
,
1987,
Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[3]
Robert C. Bolles,et al.
3DPO: A Three- Dimensional Part Orientation System
,
1986,
IJCAI.
[4]
W. Grimson,et al.
Model-Based Recognition and Localization from Sparse Range or Tactile Data
,
1984
.
[5]
Bijan Arbab.
Object Identification from Parallel Light Stripes
,
1987,
IJCAI.