2d_err, ...: Cartesian Matching with Per-Object Errors
matcher=2d_err values*='<x> <y> <error>' params='<scale>' tuning='<bin-factor>'
x: Cartesian co-ordinate #1
y: Cartesian co-ordinate #2
error: Per-object error radius
scale: Rough average of per-object error distance; just used for tuning in conjunction with bin factor
bin-factor: Scaling factor to adjust bin size; larger values mean larger bins
2d_err, ... matchers compare
positions in N-dimensional Cartesian space like the
2d matchers described in
except that the match radius can be different for each row.
Rows are considered to match when the separation reckoned by
Pythagoras between the
y, ... positions
is no larger than the sum of the two per-row
Matching in any number of Cartesian dimensions can be done by extending
this syntax in the obvious way.
scale parameter must be supplied, and should be
approximately the characteristic size of the per-object error values.
In conjunction with the
bin-factor tuning parameter
its value affects the performance of the match, but not the result.