Page 39 | Table of Contents | Index | Page 41 |

Chapters | |||

1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30A, B, C, D, E |

is not the same as applying

Any arbitrary transformation can be built up by composing a number of simpler transformations,

but that composition is not unique.

Returns a transformation that is the mathematical composition of its arguments. Composition

is in right-to-left order, that is, the resulting transformation represents the effects of applying

the

Returns a transformation that is the inverse of the

composing a transformation with its inverse is equal to the identity transformation.

If

alized inverse to transform a region through a singular transformation.

Note that with finite-precision arithmetic there are several low-level conditions that might occur

during the attempt to invert a singular or "almost singular" transformation. (These include

computation of a zero determinant, floating-point underflow during computation of the deter-

minant, or floating-point overflow during subsequent multiplication.)

These functions create a new transformation by composing the

translation, scaling, or rotation "transformation" is first, followed by

transformation

Note that these functions could be implemented by using the various constructors and

transformations

series of simple transformations.

These functions create a new transformation by composing a given translation, scaling, or rota-

tion, respectively, with the

Page 39 | Table of Contents | Index | Page 41 |

Chapters | |||

1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30A, B, C, D, E |