Extremal Reaches in Polynomial Time
This document has been relocated to https://scholarworks.smith.edu/csc_facpubs/295/
Abstract
Given a 3D polygonal chain with fixed edge lengths and fixed angles between consecutive edges (shortly, a revolutejointed chain or robot arm), the Extremal Reaches Problem asks for those configurations where the distance between the endpoints attains a global maximum or minimum value. In this paper, we solve it with a polynomial time algorithm. Copyright 2011 ACM.
This paper has been withdrawn.