Share Email Print
cover

Proceedings Paper

Parallel algorithm for computing 3D reachable workspaces
Author(s): Tarek Khaled Alameldin; Tarek M. Sobh
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of computing the 3-D workspace for redundant articulated chains has applications in a variety of fields such as robotics, computer aided design, and computer graphics. The computational complexity of the workspace problem is at least NP-hard. The recent advent of parallel computers has made practical solutions for the workspace problem possible. Parallel algorithms for computing the 3-D workspace for redundant articulated chains with joint limits are presented. The first phase of these algorithms computes workspace points in parallel. The second phase uses workspace points that are computed in the first phase and fits a 3-D surface around the volume that encompasses the workspace points. The second phase also maps the 3- D points into slices, uses region filling to detect the holes and voids in the workspace, extracts the workspace boundary points by testing the neighboring cells, and tiles the consecutive contours with triangles. The proposed algorithms are efficient for computing the 3-D reachable workspace for articulated linkages, not only those with redundant degrees of freedom but also those with joint limits.

Paper Details

Date Published: 1 March 1992
PDF: 11 pages
Proc. SPIE 1708, Applications of Artificial Intelligence X: Machine Vision and Robotics, (1 March 1992); doi: 10.1117/12.58586
Show Author Affiliations
Tarek Khaled Alameldin, California State Univ./Fresno (United States)
Tarek M. Sobh, Univ. of Pennsylvania (United States)


Published in SPIE Proceedings Vol. 1708:
Applications of Artificial Intelligence X: Machine Vision and Robotics
Kevin W. Bowyer, Editor(s)

© SPIE. Terms of Use
Back to Top