Description
Transform an explicit ordered planar point list without topology or visibility inference.
A planar affine transform combines a linear map and translation. This family stores [a,b,c,d,e,f], mapping [x,y] to [a×x+c×y+e,b×x+d×y+f]. Positions include translation; displacements use only the linear block, and normal covectors use its inverse transpose. Composition order changes the result.
Transform an explicit ordered planar point list without topology or visibility inference.
When to use this tool
Use this tool to transform an explicit ordered planar point list without topology or visibility inference.
How to use the tool and how it works
- Enter matrix, points using the input definitions below.
- Run the operation. Resolve malformed-input errors before interpreting the result.
- Read result.points. Interpret signs, units, ordering and null values using the rules below.
Apply [a×x+c×y+e,b×x+d×y+f] independently to every supplied point, preserving point order and repeats.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| matrix | Six finite coefficients [a,b,c,d,e,f] in the mapping defined above. | Dense list of at most 128 finite numbers, subject to the stated integer/shape rules. |
| points | Ordered planar positions [x,y] to transform independently. | Dense list of at most 128 rows of at most 128 finite numbers; the operation’s shape constraints also apply. |
| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.points | Transformed point list in original order. |
{
"input": {
"matrix": [
2,
0,
0,
3,
4,
5
],
"points": [
[
0,
0
],
[
1,
2
]
]
},
"output": {
"result": {
"points": [
[
4,
5
],
[
6,
11
]
]
}
}
}Limitations and assumptions
- The operation does not validate polygon topology, clip visibility or infer point identity.
- Matrices have six finite coefficients. Point/vector inputs have two components within ±1,000,000,000; rectangle bounds are likewise bounded and ordered. Coordinate units and axis directions are caller-defined. No conditioning threshold is inferred for inversion.
- Every declared top-level input is required and unknown fields are rejected. Ordinary strings are limited to 8,192 UTF-16 code units and lists to 128 entries, with tighter operation-specific bounds where stated. JSON text has bounded nesting and node counts.
- Numeric outputs must be finite and within the absolute safe-integer magnitude; exact larger integers use decimal text. Source positions are zero-based UTF-16 offsets and span ends are exclusive unless a different convention is explicitly stated.
Alternative or Complementary methods
Check coefficient layout and application order when exchanging matrices. Use point, displacement or normal operations according to the quantity being transformed, and a separate conditioning analysis for numerically sensitive inverses.
References
Similar or alternative tools
- Affine Point Transform
Transform one supplied planar point including translation.
- Affine Matrix About Anchor Transform
Move the linear transform’s origin to an explicit anchor, preserving existing translation.