Struct PoseGraph 

pub struct PoseGraph { /* private fields */ }

Pose graph with absolute node estimates and relative constraints.

Implementations

impl PoseGraph

pub fn new() -> Self

Creates an empty pose graph.

pub fn upsert_node(&mut self, id: impl Into<PoseNodeId>, pose: StampedPose)

Inserts or replaces a node estimate.

pub fn add_edge(&mut self, edge: PoseGraphEdge) -> MappingResult<()>

Adds a relative constraint.

pub fn nodes(&self) -> &HashMap<String, StampedPose>

Returns node estimates.

pub fn edges(&self) -> &[PoseGraphEdge]

Returns relative edges.

pub fn localize_from_root(&mut self, root: &PoseNodeId) -> MappingResult<()>

Propagates absolute poses along non-loop edges from a fixed root using composition.

pub fn loop_closure_candidates( &self, max_distance: f32, ) -> Vec<(PoseNodeId, PoseNodeId)>

Suggests loop closures for nodes within max_distance translation of each other.

Trait Implementations

impl Clone for PoseGraph

fn clone(&self) -> PoseGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PoseGraph

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

Formats the value using the given formatter.

impl Default for PoseGraph

fn default() -> PoseGraph

Returns the “default value” for a type.

impl PartialEq for PoseGraph

fn eq(&self, other: &PoseGraph) -> 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 StructuralPartialEq for PoseGraph