Struct spade::delaunay::DelaunayWalkLocate

pub struct DelaunayWalkLocate { /* private fields */ }

Locate strategy that walks along the edges of a triangulation until the target point is found.

This approach takes O(sqrt(n)) time on average, with a worst case of O(n) and a best case of O(1). This strategy works especially well if subsequent queries like insertion, interpolation or locate queries, are performed close to each other, as the result of the last query operation will be used as hint for the next operation.

Trait Implementations

impl Clone for DelaunayWalkLocate

fn clone(&self) -> DelaunayWalkLocate

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DelaunayWalkLocate

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

Formats the value using the given formatter.

impl Default for DelaunayWalkLocate

fn default() -> Self

Returns the “default value” for a type.

impl<T: PointN> DelaunayLocateStructure<T> for DelaunayWalkLocate

fn insert_vertex_entry(&mut self, entry: VertexEntry<T>)

This method is called when a new vertex entry has been inserted.

fn update_vertex_entry(&mut self, _: VertexEntry<T>)

This method is called when a vertex has been updated.

fn remove_vertex_entry(&mut self, _: &VertexEntry<T>)

This method is callend when a vertex has been removed.

fn find_close_handle(&self, _: &T) -> FixedVertexHandle

Returns, if possible, a vertex handle that is close to the given point.

fn new_query_result(&self, entry: FixedVertexHandle)

Notifies the locate structure about the result of a query.