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 poly tope 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 UNPACK.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Visvanathan, V., & Milor, L. S. (1986). An efficient algorithm to determine the image of a parallelepiped under a linear transformation. In Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986 (pp. 207–215). Association for Computing Machinery, Inc. https://doi.org/10.1145/10515.10538
Readers over time
Readers' Seniority
Readers' Discipline
