Enum GraphBuildAlgorithm 

#[non_exhaustive]
pub enum GraphBuildAlgorithm {
    Topological,
    ChessboardV2,
}

Which graph-build algorithm to run.

The detector ships two pipelines side by side:

• ChessboardV2 — invariant-rich 8-stage seed-and-grow pipeline (axis clustering → cell-size estimate → 4-corner seed → BFS grow → validate → boosters). Current default. Pinned for ChArUco because non-uniform marker cells defeat the topological cell test.
• Topological — Delaunay triangulation + axis-driven cell test (Shu/Brunton/Fiala 2009 with image-free classification). Lower setup cost, no global cell-size dependency. Currently opt-in only. Designed to handle severe radial distortion and low view angles that the seed-and-grow pipeline stalls on (the PuzzleBoard 130x130_puzzle low-angle target). Recall on the chessboard testdata regression set is below ChessboardV2’s; the default will flip once tolerances are tuned to match the precision-and-recall baseline. Opt in per call via DetectorParams::graph_build_algorithm.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Topological

ChessboardV2

Conservative default while topological recall catches up to ChessboardV2 on the public testdata regression set.

Trait Implementations

impl Clone for GraphBuildAlgorithm

fn clone(&self) -> GraphBuildAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphBuildAlgorithm

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

Formats the value using the given formatter.

impl Default for GraphBuildAlgorithm

fn default() -> GraphBuildAlgorithm

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GraphBuildAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphBuildAlgorithm

fn eq(&self, other: &GraphBuildAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphBuildAlgorithm

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for GraphBuildAlgorithm

impl Eq for GraphBuildAlgorithm

impl StructuralPartialEq for GraphBuildAlgorithm