Share Email Print
cover

Proceedings Paper

Location of polyhedral objects in 3-D space from three unconstrained edge points
Author(s): Horst Bunke; Hong-Seh Lim; Urs Meier
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We present algorithms for locating polyhedral objects using three edge points. An edge point is a three-dimensional data point which lies on a known edge of an object. In this paper, we assume that the precise position of an edge point on an edge is not known. In general, with three edge points, we have to solve a system of nonlinear equations. However, there are special cases, where we can solve the location problem analytically. The special cases depend on the collinearity and coplanarity of the three edge points.

Paper Details

Date Published: 1 March 1992
PDF: 12 pages
Proc. SPIE 1608, Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods, (1 March 1992); doi: 10.1117/12.135103
Show Author Affiliations
Horst Bunke, Univ. Bern (Switzerland)
Hong-Seh Lim, Calera Recognition System Inc. (United States)
Urs Meier, Univ. Bern (Switzerland)


Published in SPIE Proceedings Vol. 1608:
Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top