An efficient algorithm to determine the image of a parallelepiped under a linear transformation

Authors:
V Visvanathan;L S Milor
Affiliations:
AT&T Bell Laboratories, Murray Hill, New Jersey;AT&T Bell Laboratories, Murray Hill, New Jersey
Venue:
SCG '86 Proceedings of the second annual symposium on Computational geometry
Year:
1986

Citing 1
Cited 1

An Algorithm for Convex Polytopes

Journal of the ACM (JACM)

Wrench capabilities of planar parallel manipulators. part i: Wrench polytopes and performance indices

Robotica

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm to determine the image of a parallelepiped under a linear transformation is presented. The work was motivated by certain problems in the testing of analog integrated circuits. The method is based on specifying the boundary hyperplanes that define the image polytope and is of polynomial complexity in n (the dimension of the parallelepiped), for a fixed value of the dimension of the range of the linear transformation. The algorithm has been implemented using library routines from LINPACK.