pub struct PointCorrespondences<'a> {
pub image_points: &'a [Point2f],
pub object_points: &'a [[f64; 3]],
pub information_matrices: &'a [Matrix2<f64>],
pub group_size: usize,
pub seed_poses: &'a [Option<Pose>],
}Expand description
A flat, contiguous view of M 2D-3D point correspondences for pose estimation.
Points are organised in contiguous groups of group_size
elements. The inlier bitmask operated on by RobustPoseSolver tracks one
bit per group, keeping the mask size bounded at 1 024 bits regardless of
group_size.
| Pipeline | group_size | Bit semantics |
|---|---|---|
| AprilGrid | 4 | 1 bit = 1 tag (4 corners) |
| ChAruco saddles | 1 | 1 bit = 1 saddle point |
Lifetime: the slices are typically backed by pre-allocated scratch
buffers owned by BoardEstimator or by arena memory, ensuring zero heap
allocation on the hot path.
Fields§
§image_points: &'a [Point2f]Observed 2D image points (pixels). Length = M.
object_points: &'a [[f64; 3]]Corresponding 3D model points (board frame, metres). Length = M.
information_matrices: &'a [Matrix2<f64>]Pre-inverted observation covariances (information matrices). Length = M.
Must be positive semi-definite; use Matrix2::identity for isotropic
unit weighting.
group_size: usizeNumber of consecutive points forming one logical correspondence group.
M must be an exact multiple of group_size.
seed_poses: &'a [Option<Pose>]Per-group seed pose hypotheses for RANSAC initialisation.
Length = M / group_size. None signals a degenerate or occluded
group that RANSAC must skip as a minimal-sample candidate.
Implementations§
Source§impl PointCorrespondences<'_>
impl PointCorrespondences<'_>
Sourcepub fn num_groups(&self) -> usize
pub fn num_groups(&self) -> usize
Number of correspondence groups: M / group_size.
Auto Trait Implementations§
impl<'a> Freeze for PointCorrespondences<'a>
impl<'a> RefUnwindSafe for PointCorrespondences<'a>
impl<'a> Send for PointCorrespondences<'a>
impl<'a> Sync for PointCorrespondences<'a>
impl<'a> Unpin for PointCorrespondences<'a>
impl<'a> UnsafeUnpin for PointCorrespondences<'a>
impl<'a> UnwindSafe for PointCorrespondences<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.