Functions — github.com/Stoeoef/spade

hub / github.com/Stoeoef/spade / functions

Functions805 in github.com/Stoeoef/spade

⨍ Functions 805◇ Types & classes 106

Estimates and returns the gradient for a single vertex in this triangulation. This assumes that the triangulation models some kind of height field. T

src/delaunay_core/interpolation.rs:648

↓ 3 callersMethodexclude_outer_faces

A refinement operation configured to exclude outer faces. All colored faces are considered outer faces and are ignored during refinement. Note that th

src/delaunay_core/refinement.rs:319

↓ 3 callersFunctionextend_line

( dcel: &mut Dcel<V, DE, UE, F>, end_vertex: FixedVertexHandle, new_vertex_handle: FixedVertexHand

src/delaunay_core/dcel_operations.rs:393

↓ 3 callersMethodfixed_inner_faces

An iterator visiting all inner faces of the triangulation. The iterator type is [FixedFaceHandle<InnerTag, ...>](FixedFaceHandle).

src/triangulation.rs:603

↓ 3 callersMethodfixed_vertices

(&self)

src/delaunay_core/dcel.rs:335

↓ 3 callersMethodfrom

(value: DelaunayTriangulation<V, DE, UE, F, L>)

src/cdt.rs:295

↓ 3 callersMethodfrom

Returns the voronoi vertex from which this edge originates.

src/delaunay_core/handles/public_handles.rs:295

↓ 3 callersFunctionget_cdt_for_try_add_constraint

()

src/cdt.rs:2009

↓ 3 callersMethodget_hint

(&self, _: Point2<S>)

src/delaunay_core/hint_generator.rs:94

↓ 3 callersMethodinitialize_buckets

(&mut self, target_size: usize)

src/delaunay_core/bulk_load.rs:866

↓ 3 callersMethodinsert_on_edge

( &mut self, edge: FixedDirectedEdgeHandle, new_vertex: FixedVertexHandle, )

src/delaunay_core/triangulation_ext.rs:340

↓ 3 callersMethodinterpolate_gradient

Interpolates a value at a given position. In contrast to [Self::interpolate], this method has a well-defined derivative at each vertex and will appro

src/delaunay_core/interpolation.rs:403

↓ 3 callersMethodinto_vertex

(self)

src/delaunay_core/triangulation_ext.rs:33

↓ 3 callersFunctionisolate_vertex_and_fill_hole

Removes a vertex from the DCEL. Then, the resulting hole will be re-triangulated with a triangle fan.

src/delaunay_core/dcel_operations.rs:68

↓ 3 callersMethodlocate_and_remove

Attempts to remove a vertex from the triangulation. Returns the removed vertex data if it could be found. # Handle invalidation This method will inv

src/triangulation.rs:515

↓ 3 callersMethodlocate_with_hint

Returns information about the location of a point in a triangulation. Additionally, a hint can be given to speed up computation. The hint should be a

src/triangulation.rs:477

↓ 3 callersFunctionmitigate_underflow_for_coordinate

(coordinate: S)

src/delaunay_core/math.rs:163

↓ 3 callersMethodnearest_neighbor

Returns the nearest neighbor of a given input vertex. Returns `None` if the triangulation is empty. # Runtime This method takes `O(sqrt(n))` on aver

src/delaunay_triangulation.rs:294

↓ 3 callersMethodnum_directed_edges

Returns the number of directed edges in this triangulation.

src/triangulation.rs:277

↓ 3 callersMethodnum_directed_edges

(&self)

src/delaunay_core/dcel.rs:173

↓ 3 callersFunctionrefinement_maximum_area_scenario

(max_area: Option<f64>)

examples/svg_renderer/scenario_list.rs:1373

↓ 3 callersMethodreversed

Returns the inverse of this point projection. The inverse projection projects the same point on the *reversed* edge used by the original projection.

src/delaunay_core/math.rs:203

↓ 3 callersFunctionsmall_cdt_vertices

()

src/delaunay_core/bulk_load.rs:1286

↓ 3 callersFunctionsplit_edge

Splits `edge_handle`, introducing 6 new half edges, two new faces and one new vertex. Returns the newly created vertex handle and the two resulting p

src/delaunay_core/dcel_operations.rs:658

↓ 3 callersFunctionsplit_half_edge

Splits `edge_handle` only one side. Used to split edges on the convex hull. Returns the newly inserted vertex and the two resulting parts of the spli

src/delaunay_core/dcel_operations.rs:528

↓ 3 callersFunctionswap_remove_undirected_edge

( dcel: &mut Dcel<V, DE, UE, F>, edge_handle: FixedUndirectedEdgeHandle, )

src/delaunay_core/dcel_operations.rs:1108

↓ 3 callersMethodundirected_voronoi_edges

An iterator visiting all undirected voronoi edges. The iterator type is [UndirectedVoronoiEdge]

src/triangulation.rs:406

↓ 3 callersMethodupdate_bucket_segment

(&mut self, left_bucket: usize, right_bucket: usize, new_value: usize)

src/delaunay_core/bulk_load.rs:1003

↓ 3 callersMethodwalk_to_nearest_neighbor

( &self, start: FixedVertexHandle, position: Point2<<Self::Vertex as HasPosition>::Sca

src/delaunay_core/triangulation_ext.rs:456

↓ 3 callersMethodwith_max_additional_vertices

Specifies how many additional vertices may be inserted during Delaunay refinement. Refinement may, in some cases, fail to terminate if the angle limi

src/delaunay_core/refinement.rs:278

↓ 2 callersFunctionadd_circular_arrows

(sketch: &mut Sketch, center: Point, is_lhs: bool, radius: f64)

examples/svg_renderer/scenario_list.rs:50

↓ 2 callersMethodadjust_hint_generator

Swaps out and re-initializes the hint generator.

src/cdt.rs:1133

↓ 2 callersMethodall_component_wise

(&self, other: Self, f: impl Fn(S, S) -> bool)

src/point.rs:86

↓ 2 callersMethodangle

(mut self, angle: Deg<f64>)

examples/svg_renderer/quicksketch/mod.rs:309

↓ 2 callersMethodarc_to

( mut self, radii: Vector, rotation: Deg<f64>, large_arc: bool, sweep:

examples/svg_renderer/quicksketch/mod.rs:377

↓ 2 callersMethodarea

Returns the triangle's area.

src/delaunay_core/handles/handle_impls.rs:633

↓ 2 callersMethodas_delaunay_face

Returns the dual delaunay face of this voronoi vertex. Returns `None` if this is an outer voronoi vertex.

src/delaunay_core/handles/public_handles.rs:236

↓ 2 callersMethodas_edge_intersection

Returns the intersected edge if this is an edge intersection or `None` otherwise.

src/intersection_iterator.rs:137

↓ 2 callersMethodbarycentric

Used for barycentric interpolation on this triangulation. Refer to the documentation of [Barycentric] and [crate::NaturalNeighbor] for more informatio

src/triangulation.rs:779

↓ 2 callersMethodbasic_sanity_check

(&self, check_convexity: bool)

src/delaunay_core/triangulation_ext.rs:837

↓ 2 callersMethodcdt_sanity_check_with_params

(&self, check_convexity: bool)

src/cdt.rs:737

↓ 2 callersFunctioncheck_bulk_load_cdt

(edges: Vec<[usize; 2]>)

src/delaunay_core/bulk_load.rs:1299

↓ 2 callersMethodclear

(&mut self)

src/cdt.rs:278

↓ 2 callersMethodcontains_any_constraint_edge

( &self, mut line_intersection_iterator: LineIntersectionIterator<V, DE, CdtEdge<UE>, F>,

src/cdt.rs:463

↓ 2 callersMethodconvex_hull_size

Returns the number of edges of the convex hull. See also [convex_hull](Triangulation::convex_hull) # Complexity This method does not need to iterate

src/triangulation.rs:287

↓ 2 callersFunctioncreate_refinement_cdt

()

examples/svg_renderer/scenario_list.rs:1278

↓ 2 callersFunctiondelaunay_edge_details_triangulation

( )

examples/svg_renderer/scenario_list.rs:362

↓ 2 callersMethoddraw_double_line

(mut self)

examples/svg_renderer/quicksketch/mod.rs:447

↓ 2 callersMethodedges

(&self)

src/flood_fill_iterator.rs:156

↓ 2 callersFunctionexclude_outer_faces_scenario

(do_refine: bool)

examples/svg_renderer/scenario_list.rs:1245

↓ 2 callersMethodface_adjacent_edge

( &self, handle: FixedHandleImpl<FaceTag, InnerOuter>, )

src/delaunay_core/dcel.rs:280

↓ 2 callersFunctionfix_convexity

Makes the outer hull convex. Similar to a graham scan.

src/delaunay_core/bulk_load.rs:696

↓ 2 callersFunctionfix_handle_swap

( dcel: &mut Dcel<V, DE, UE, F>, edge_handle: FixedDirectedEdgeHandle, )

src/delaunay_core/dcel_operations.rs:1120

↓ 2 callersMethodfloored_bucket

Looks up what bucket a given pseudo-angle will fall into.

src/delaunay_core/bulk_load.rs:1048

↓ 2 callersFunctionget_border_loop

( vertex: VertexHandle<V, DE, UE, F>, )

src/delaunay_core/dcel_operations.rs:1445

↓ 2 callersMethodget_directed_data

( &self, handle: FixedHandleImpl<DirectedEdgeTag, InnerOuter>, )

src/delaunay_core/dcel.rs:59

↓ 2 callersMethodget_edges_in_circle

Example: Shows all edges (red) that are returned when iterating over a circle (teal) # Panics Panics if `radius_2 < 0.0` # Memory consumption Memo

src/triangulation.rs:707

↓ 2 callersFunctionget_epsilon_grid

(grid_size: usize)

src/delaunay_core/bulk_load.rs:1192

↓ 2 callersFunctionget_natural_neighbor_edges

( triangulation: &T, inspect_buffer: &mut Vec<FixedDirectedEdgeHandle>, position: Point2<<T::Verte

src/delaunay_core/interpolation.rs:704

↓ 2 callersMethodget_vertices_in_circle

Example: Shows all vertices (red) that are returned when iterating over a circle (teal) # Panics Panics if `radius_2 < 0.0` # Memory consumption C

src/triangulation.rs:763

↓ 2 callersMethodget_vertices_in_rectangle

Example: Shows all vertices (red) that are returned when iterating over a rectangle (teal) # Memory consumption Consumed memory is in `O(|convex_hul

src/triangulation.rs:733

↓ 2 callersMethodhint_generator

(&self)

src/delaunay_triangulation.rs:427

↓ 2 callersMethodinit

(&mut self, vertices: impl Iterator<Item = [f64; 2]>)

delaunay_compare/src/cdt_crate.rs:9

↓ 2 callersMethodinsert_outside_of_convex_hull

( &mut self, convex_hull_edge: FixedDirectedEdgeHandle, new_vertex: FixedVertexHandle,

src/delaunay_core/triangulation_ext.rs:270

↓ 2 callersMethodinsert_with_hint_option

( &mut self, t: Self::Vertex, hint: Option<FixedVertexHandle>, )

src/delaunay_core/triangulation_ext.rs:97

↓ 2 callersFunctioninspect_flips

Identifies natural neighbors. To do so, this function "simulates" the insertion of a vertex (located at `position) and keeps track of which edges wou

src/delaunay_core/interpolation.rs:760

↓ 2 callersFunctionintersects_edge_non_collinear

( from0: Point2<S>, to0: Point2<S>, from1: Point2<S>, to1: Point2<S>, )

src/delaunay_core/math.rs:319

↓ 2 callersMethodintersects_edge_non_collinear

( &self, other_from: Point2<V::Scalar>, other_to: Point2<V::Scalar>, )

src/delaunay_core/handles/handle_impls.rs:409

↓ 2 callersMethodinto_parts

( self, )

src/cdt.rs:268

↓ 2 callersFunctionis_behind_edge

Same as `project_point(e1, e2, query_point).is_behind_edge()` but with an added factor against floating point inaccuracies. This doesn't use precise f

src/delaunay_core/math.rs:391

↓ 2 callersFunctionis_encroaching_edge

( edge_from: Point2<S>, edge_to: Point2<S>, query_point: Point2<S>, )

src/delaunay_core/refinement.rs:947

↓ 2 callersFunctionlhs_rhs_scenario

(is_lhs: bool)

examples/svg_renderer/scenario_list.rs:96

↓ 2 callersMethodlocate_when_all_vertices_on_line

( &self, position: Point2<<Self::Vertex as HasPosition>::Scalar>, )

src/delaunay_core/triangulation_ext.rs:169

↓ 2 callersMethodmap_undirected_edges

(self, f: M)

src/delaunay_core/dcel.rs:150

↓ 2 callersMethodmax

()

src/delaunay_core/handles/handle_defs.rs:73

↓ 2 callersFunctionnatural_neighbor_area_scenario

Only used for internal documentation of natural neighbor area calculation

examples/svg_renderer/scenario_list.rs:1044

↓ 2 callersFunctionnearest_point

(p1: Point2<S>, p2: Point2<S>, query_point: Point2<S>)

src/delaunay_core/math.rs:231

↓ 2 callersFunctionnearest_power_of_two

(input: S)

src/delaunay_core/refinement.rs:958

↓ 2 callersMethodnext

(&mut self)

src/flood_fill_iterator.rs:259

↓ 2 callersMethodnormalize_index

(self)

src/delaunay_core/handles/handle_impls.rs:87

↓ 2 callersMethodnotify_vertex_inserted

(&mut self, vertex: FixedVertexHandle, _: Point2<S>)

src/delaunay_core/hint_generator.rs:102

↓ 2 callersMethodopacity

(mut self, opacity: f64)

examples/svg_renderer/quicksketch/mod.rs:261

↓ 2 callersMethodouter_face

(&self)

src/delaunay_core/dcel.rs:209

↓ 2 callersMethodposition

The position of this voronoi vertex. Returns `None` if this vertex is an outer voronoi vertex. Otherwise, the returned position is the [circumcenter]

src/delaunay_core/handles/public_handles.rs:226

↓ 2 callersMethodproject_point

An image displaying differently colored areas which would result in different point projections # Example ``` # fn main() -> Result<(), spade::Insert

src/delaunay_core/handles/handle_impls.rs:401

↓ 2 callersFunctionprop_test_bulk_load_cdt_stable_impl

(points: Vec<(f32, f32)>, edges: Vec<(usize, usize)>)

src/cdt.rs:2570

↓ 2 callersFunctionrefinement_scenario

(do_refine: bool)

examples/svg_renderer/scenario_list.rs:1233

↓ 2 callersMethodrelative_position

Returns the relative position of the point used to create this projection relative to the edge used when creating this projection. This method will r

src/delaunay_core/math.rs:220

↓ 2 callersMethodremove_and_notify

(&mut self, vertex_to_remove: FixedVertexHandle)

src/delaunay_core/triangulation_ext.rs:645

↓ 2 callersMethodremove_constraint_edge

Removes a constraint edge. Does nothing and returns `false` if the given edge is not a constraint edge. Otherwise, the edge is unmarked and the Delau

src/cdt.rs:757

↓ 2 callersMethodresolve_conflict_region

Takes a conflict region (expressed as a list of intersecting edges) rotates edges to create a new constraint edge. Then, the rotated edges (except the

src/cdt.rs:610

↓ 2 callersMethodresolve_encroachment

( &mut self, encroached_segments_buffer: &mut VecDeque<FixedUndirectedEdgeHandle>, enc

src/delaunay_core/refinement.rs:761

↓ 2 callersMethodresolve_splitting_constraint_request

( &mut self, mut from: FixedVertexHandle, to: FixedVertexHandle, vertex_constr

src/cdt.rs:866

↓ 2 callersFunctionrun_all

(mut group: BenchmarkGroup<WallTime>, sizes: &[usize])

delaunay_compare/benches/delaunay_comparison.rs:36

↓ 2 callersMethodrun_creation

(&self)

delaunay_compare/src/cdt_crate.rs:13

↓ 2 callersMethodsegment

(&self, node: &Node)

src/delaunay_core/bulk_load.rs:1056

↓ 2 callersMethodshortest_edge

(&self)

src/delaunay_core/handles/handle_impls.rs:690

↓ 2 callersFunctionsingle_bulk_insertion_step

Prevent inlining for better profiling data

src/delaunay_core/bulk_load.rs:530

↓ 2 callersFunctionsmall_line

(from: Point2<f64>, to: Point2<f64>)

examples/svg_renderer/scenario_list.rs:1423

↓ 2 callersFunctiontest_add_multiple_constraints

(overlapping: bool)

src/cdt.rs:1509

← previous next →201–300 of 805, ranked by callers