Location of polyhedral objects in 3-D space from three unconstrained edge points

Horst Bunke; Hong-Seh Lim; Urs Meier

doi:10.1117/12.135103

1 March 1992 Location of polyhedral objects in 3-D space from three unconstrained edge points

Horst Bunke, Hong-Seh Lim, Urs Meier

Proceedings Volume 1608, Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods; (1992) https://doi.org/10.1117/12.135103
Event: Robotics '91, 1991, Boston, MA, United States

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.

Citation Download Citation

Horst Bunke, Hong-Seh Lim, and Urs Meier "Location of polyhedral objects in 3-D space from three unconstrained edge points", Proc. SPIE 1608, Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods, (1 March 1992); https://doi.org/10.1117/12.135103

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available