Struct SquareGridDetection 

#[non_exhaustive]
pub struct SquareGridDetection {
    pub labelled: HashMap<(i32, i32), usize>,
    pub by_corner: HashMap<usize, (i32, i32)>,
    pub axis_i: Vector2<f32>,
    pub axis_j: Vector2<f32>,
    pub cell_size: f32,
    pub stats: SquareGridStats,
}

Final outcome of detect_square_grid.

labelled is the canonical product — every entry maps a (i, j) grid cell to a corner index in the caller’s positions slice. The bounding box of the labelled set is rebased so the minimum (i, j) is (0, 0).

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

labelled: HashMap<(i32, i32), usize>

(i, j) → corner_idx map for every recovered corner.

by_corner: HashMap<usize, (i32, i32)>

Inverse map: corner_idx → (i, j).

axis_i: Vector2<f32>

Pixel-space unit vector along the grid’s i direction, inferred from the seed quad. Useful for downstream overlays.

axis_j: Vector2<f32>

Pixel-space unit vector along the grid’s j direction.

cell_size: f32

Cell size in pixels, taken from the seed quad’s mean edge length. Approximate under non-uniform perspective; downstream metric work should refit a homography from the labelled set.

stats: SquareGridStats

Per-stage diagnostic counters.

Trait Implementations

impl Debug for SquareGridDetection

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.