Document Type
Conference Proceeding
Publication Date
7-15-2011
Publication Title
Proceedings of the Annual Symposium on Computational Geometry
Abstract
We present the first exact, combinatorial, polynomial time algorithm for computing the description of the workspace boundary for the class of revolute jointed robot arms arising from polygonal orthogonal chains in 3D. Copyright 2011 ACM.
Keywords
Pseudotriangulation, Reach problem, Revolute joint, Robot arm, Workspace
First Page
481
Last Page
490
DOI
10.1145/1998196.1998274
Rights
© 2011 ACM
Recommended Citation
Borcea, Ciprian S. and Streinu, Ileana, "Exact Workspace Boundary by Extremal Reaches" (2011). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/242
Comments
Archived as published.