Closure polynomials for strips of tetrahedra
Document typeConference report
Rights accessOpen Access
A tetrahedral strip is a tetrahedron-tetrahedron truss where any tetrahedron has two neighbors except those in the extremes which have only one. Unless any of the tetrahedra degenerate, such a truss is rigid. In this case, if the distance between the strip endpoints is imposed, any rod length in the truss is constrained by all the others to attain discrete values. In this paper, it is shown how to characterize these values as the roots of a closure polynomial whose derivation requires surprisingly no other tools than elementary algebraic manipulations. As an application of this result, the forward kinematics of two parallel platforms with closure polynomials of degree 16 and 12 is straightforwardly solved.
The final publication is available at link.springer.com
CitationThomas, F., Porta, J.M. Closure polynomials for strips of tetrahedra. A: International Conference on Advances in Robot Kinematics. "Advances in Robot Kinematics, Vol 4 of Springer Proceedings in Advanced Robotics". Grasse: Springer, 2016, p. 303-312.