7.1.8 2d_cuboid, ...: Cuboid Cartesian Matching

matcher=2d_cuboid values*='<x> <y>'
                  params='<error-in-x> <error-in-y>'
                  tuning='<bin-factor>'

values*:

• x: Cartesian co-ordinate #1
• y: Cartesian co-ordinate #2

params:

• error-in-x: Half length of cuboid in Cartesian co-ordinate #1 direction
• error-in-y: Half length of cuboid in Cartesian co-ordinate #2 direction

tuning:

• bin-factor: Scaling factor to adjust bin size; larger values mean larger bins

The 2d_cuboid matcher compares positions in 2-dimensional Cartesian space in cuboidal cells. Rows are considered to match if their (x,y) positions fall within an error cuboid with half-axis lengths error-in-x, error-in-y of each other. This kind of match is suitable for grouping items into pixels, though it's not a very efficient way of doing that.

Matching in any number of dimensions using N-dimensional hyper-cuboids can be done by extending this syntax in the obvious way.