Struct MyopicTorus 

pub struct MyopicTorus<I: ICompatible<V>, V: VCompatible<I>>(pub Torus<I, V>);

A deliberately overlapping bounded domain on Torus.

This exercises NerveComplex when many cover nodes see the same region rather than forming the regular cover represented by TorusCover.

Tuple Fields

0: Torus<I, V>

Implementations

impl<I: ICompatible<V>, V: VCompatible<I>> MyopicTorus<I, V>

pub fn s() -> usize

Returns the number of cover samples along each torus coordinate.

Trait Implementations

impl<I: ICompatible<V>, V: VCompatible<I>> AsRef<MyopicTorus<I, V>> for MyopicTorusCover<I, V>

fn as_ref(&self) -> &MyopicTorus<I, V>

Converts this type into a shared reference of the (usually inferred) input type.

impl<I: ICompatible<V>, V: VCompatible<I>> AsRef<Torus<I, V>> for MyopicTorus<I, V>

fn as_ref(&self) -> &Torus<I, V>

Converts this type into a shared reference of the (usually inferred) input type.

impl<I: ICompatible<V>, V: VCompatible<I>> Bounded<MyopicTorus<I, V>, Torus<I, V>, V> for MyopicTorusCover<I, V>

fn sdf(&self, v: &V) -> <V as Tensor>::F

impl<I: ICompatible<V>, V: VCompatible<I>> Bounded<Torus<I, V>, Torus<I, V>, V> for MyopicTorus<I, V>

fn sdf(&self, v: &V) -> <V as Tensor>::F

impl<I: ICompatible<V>, V: VCompatible<I>> Chart<Torus<I, V>, V> for MyopicTorus<I, V>

type Global = <Torus<I, V> as Chart<Torus<I, V>, V>>::Global

The result of mapping local coordinates back onto the manifold.

fn to_local(&self, p: &Torus<I, V>) -> Option<V>

fn to_global(&self, c: V) -> Self::Global

fn chart_at(p: &Torus<I, V>) -> Self

fn local_distance(&self, other: &P) -> Option<<V::F as Field>::Fixed>

where V: Euclidean,

Calculates the distance between self and other in local coordinates, based at &self.

fn check_local_inverse(p: &P) -> bool

where P: PartialEq,

impl<I: Clone + ICompatible<V>, V: Clone + VCompatible<I>> Clone for MyopicTorus<I, V>

fn clone(&self) -> MyopicTorus<I, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug + ICompatible<V>, V: Debug + VCompatible<I>> Debug for MyopicTorus<I, V>

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

Formats the value using the given formatter.

impl<I: ICompatible<V>, V: VCompatible<I>> ExpMap<Torus<I, V>, V> for MyopicTorus<I, V>

fn base_point(&self) -> Torus<I, V>

fn check_base_point_is_origin(&self) -> bool

where V: Form,

fn check_preservation_of_origin(&self) -> bool

where V: Form,

fn check_chart_at_base_point(&self) -> bool

where V: Form,

If a chart centred at p exists, chart_at(p) returns it. Formally: chart_at(p).base_point() == p whenever p is the base point of some valid chart in this atlas.

impl<I: ICompatible<V>, V: VCompatible<I>> From<MyopicTorus<I, V>> for MyopicTorusCover<I, V>

fn from(value: MyopicTorus<I, V>) -> Self

Converts to this type from the input type.

impl<I: ICompatible<V>, V: VCompatible<I>> From<Torus<I, V>> for MyopicTorus<I, V>

fn from(value: Torus<I, V>) -> Self

Converts to this type from the input type.

impl<I: ICompatible<V>, V: VCompatible<I>> NerveComplexParameters<Torus<I, V>, V, MyopicTorus<I, V>, MyopicTorusCover<I, V>> for MyopicTorusCover<I, V>

fn overestimation_bound() -> Option<(V::F, V::F)>

The one irreducible assumption: graph distance on the 1-skeleton overestimates true geodesic distance by at most a factor 1 + e.

fn max_candidate_paths() -> usize

Hard cap on how many candidate edge-paths are straightened. Raising it strengthens the guarantee; lowering it trades certification for speed.

fn max_frontier() -> usize

Cap on heap entries. Prefixes vastly outnumber completions, and this is the quantity that threatens memory. Independent of the above: no ratio between prefixes-in-flight and completions exists.

fn max_rescues() -> usize

Cap on local insertions before declaring the charts unusable. when flowing a polyline, sometimes a point might go out of the injectivity radius of its neighbors, in that case, we insert a point between them to try to rescue the polyline.

fn max_straightening_iterations(n: usize) -> usize

Iteration cap for the flow, as a function of vertex count.

fn max_samples() -> usize

Cap on samples per same_basin comparison. Exceeding it means the polyline is longer than max_samples · δ_s, and no comparison at that spacing could prove two prefixes share a basin — so the prune is declined rather than performed on insufficient evidence.

fn max_canonical_generators() -> usize

Generator count above which fundamental_group returns a correct but non-canonical presentation.

fn prefix_smoothing_sweeps() -> usize

Sweeps of the discrete geodesic flow applied to a prefix before it is compared for basin membership.

fn max_basins_per_class() -> usize

fn get_neighbors(i: usize) -> impl Iterator<Item = usize>

Returns the indices of nodes whose bounded domains overlap the bounded domain of this node — the 1-skeleton of the nerve.

impl<I: ICompatible<V>, V: VCompatible<I>> TangentBundle<Torus<I, V>, V> for MyopicTorus<I, V>

fn check_universal_centring(p: P) -> bool

where V: Form,