Functions — github.com/Stoeoef/spade

hub / github.com/Stoeoef/spade / functions

Functions805 in github.com/Stoeoef/spade

⨍ Functions 805◇ Types & classes 106

↓ 9 callersMethodwith_arrow_start

(mut self, arrow_type: ArrowType)

examples/svg_renderer/quicksketch/mod.rs:425

↓ 8 callersMethodas_delaunay_edge

Shows various inner voronoi edges (blue) and their dual Delaunay edges (orange)

src/delaunay_core/handles/public_handles.rs:322

↓ 8 callersMethodccw

Returns the next edge in counterclockwise direction. Note that this assumes that you use a right-handed coordinate system, otherwise the sense of ori

src/delaunay_core/handles/handle_impls.rs:289

↓ 8 callersMethodconvex_hull

A triangulation with its convex hull being highlighted. `e0` .. `e5` denote the returned edges in clockwise order. See also [convex_hull_size](Triang

src/triangulation.rs:626

↓ 8 callersMethodget_weights

Returns the barycentric coordinates and the respective vertices for a given query position. The resulting coordinates and vertices are stored within

src/delaunay_core/interpolation.rs:174

↓ 8 callersFunctioninsert_into_triangle

( dcel: &mut Dcel<V, DE, UE, F>, v: FixedVertexHandle, f0: FixedFaceHandle<InnerTag>, )

src/delaunay_core/dcel_operations.rs:870

↓ 8 callersMethodinterpolate

Performs barycentric interpolation on this triangulation at a given position. Returns `None` for any value outside the triangulation's convex hull. T

src/delaunay_core/interpolation.rs:206

↓ 8 callersMethodis_handle_inside

(&self, handle: UndirectedEdgeHandle<V, DE, UE, F>)

src/flood_fill_iterator.rs:27

↓ 8 callersMethodout_edge

Returns an outgoing edge of this vertex. If the vertex has multiple outgoing edges, any of them is returned.

src/delaunay_core/handles/handle_impls.rs:761

↓ 7 callersFunctioncreate_test_triangulation

()

src/intersection_iterator.rs:555

↓ 7 callersMethodfixed_undirected_edges

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

src/triangulation.rs:579

↓ 7 callersMethodis_point_inside

(&self, point: Point2<S>)

src/flood_fill_iterator.rs:151

↓ 7 callersMethodlegalize_edges_after_removal

After a vertex removal, the created hole is stitched together by connecting all vertices to a single vertex at the border (triangle fan). Since these

src/delaunay_core/triangulation_ext.rs:773

↓ 7 callersMethodmake_constraint_edge

(&mut self)

src/cdt.rs:47

↓ 7 callersFunctionpseudo_angle

(a: Point2<f64>, center: Point2<f64>)

src/delaunay_core/bulk_load.rs:1095

↓ 7 callersMethodresolve

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

src/delaunay_core/triangulation_ext.rs:53

↓ 7 callersMethodset_view_box_max

(&mut self, view_box_max: Point)

examples/svg_renderer/quicksketch/mod.rs:667

↓ 7 callersMethodset_view_box_min

(&mut self, view_box_min: Point)

examples/svg_renderer/quicksketch/mod.rs:662

↓ 7 callersMethodshift_from

(mut self, shift_from: f64)

examples/svg_renderer/quicksketch/mod.rs:462

↓ 7 callersMethodstroke_style

(mut self, stroke_style: StrokeStyle)

examples/svg_renderer/quicksketch/mod.rs:217

↓ 7 callersFunctionto_robust_coord

(point: Point2<S>)

src/delaunay_core/math.rs:263

↓ 6 callersMethodall_vertices_on_line

Returns `true` if all vertices lie on a single line. This is always the case for triangulations with 0, 1 or two vertices.

src/triangulation.rs:612

↓ 6 callersMethodceiled_bucket

(&self, angle: FloatOrd<f64>)

src/delaunay_core/bulk_load.rs:1052

↓ 6 callersMethodclose

(mut self)

examples/svg_renderer/quicksketch/mod.rs:395

↓ 6 callersFunctioncreate_single_face_between_edge_and_next

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

src/delaunay_core/dcel_operations.rs:215

↓ 6 callersMethodget

Gets an edge of the hull which covers a given input angle. An edge is considered to cover an input angle if the input angle is contained in the angle

src/delaunay_core/bulk_load.rs:1032

↓ 6 callersMethodget_attribute_string

(&self, converter: &mut SketchConverter)

examples/svg_renderer/quicksketch/mod.rs:69

↓ 6 callersFunctionhull_sanity_check

(triangulation: &impl Triangulation, hull: &Hull)

src/delaunay_core/bulk_load.rs:1101

↓ 6 callersMethodis_constraint_edge

Returns `true` if this edge is a constraint edge.

src/delaunay_core/handles/handle_impls.rs:437

↓ 6 callersMethodis_on_right_side

Returns `true` if a point lies on the right side of a line. For left-handed coordinate systems, this method returns if a point lies on the left side

src/delaunay_core/line_side_info.rs:37

↓ 6 callersFunctionis_ordered_ccw

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

src/delaunay_core/math.rs:290

↓ 6 callersMethodis_outer

(&self)

src/delaunay_core/handles/handle_impls.rs:188

↓ 6 callersMethodlegalize_edge

The Delaunay property refers to the property that no point lies inside the circumcircle of the triangulation's triangles. Adding a new point into the

src/delaunay_core/triangulation_ext.rs:388

↓ 6 callersMethodnormalized

(&self)

src/delaunay_core/handles/handle_impls.rs:459

↓ 6 callersMethodnot_normalized

(&self)

src/delaunay_core/handles/handle_impls.rs:464

↓ 6 callersMethodnotify_vertex_lookup

(&self, vertex: FixedVertexHandle)

src/delaunay_core/hint_generator.rs:98

↓ 6 callersFunctionrun_bulk_load_proptest

(points: &[(f32, f32)])

src/cdt.rs:2398

↓ 6 callersFunctionsetup_initial_two_vertices

( dcel: &mut Dcel<V, DE, UE, F>, first_vertex: FixedVertexHandle, second_vertex: FixedVertexHandle

src/delaunay_core/dcel_operations.rs:839

↓ 6 callersFunctionswap_remove_vertex

Removes a vertex from the DCEL by swapping in another. This operation *will* leave the DCEL in an inconsistent state, the caller must ensure to fix t

src/delaunay_core/dcel_operations.rs:1162

↓ 6 callersMethodtry_add_constraint

Attempts to add a constraint edge. Leaves the triangulation unchanged if the new edge would intersect an existing constraint edge. Returns all constr

src/cdt.rs:807

↓ 5 callersFunctionadd_label

(result: &mut Sketch, text: &'static str, position: Point2<f64>)

examples/svg_renderer/scenario_list.rs:1491

↓ 5 callersMethodas_ref

(&self)

examples/svg_renderer/scenario.rs:45

↓ 5 callersMethoddirected_edges

(&self)

src/delaunay_core/dcel.rs:323

↓ 5 callersFunctiondistance_2

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

src/delaunay_core/math.rs:255

↓ 5 callersMethoddistance_2

Returns the squared distance of a point to this edge.

src/delaunay_core/handles/handle_impls.rs:555

↓ 5 callersFunctionflip_cw

Flip an edge in cw direction

src/delaunay_core/dcel_operations.rs:1050

↓ 5 callersFunctionhierarchy_sanity_check

(triangulation: &HierarchyTriangulation)

src/delaunay_core/hint_generator.rs:351

↓ 5 callersMethodhint_generator_mut

(&mut self)

src/cdt.rs:229

↓ 5 callersMethodinsert_with_hint_option_impl

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

src/delaunay_core/triangulation_ext.rs:111

↓ 5 callersMethodis_on_edge

Returns `true` if a point's projection is located on an edge. See [DirectedEdgeHandle::project_point](crate::handles::DirectedEdgeHandle::project_poi

src/delaunay_core/math.rs:193

↓ 5 callersMethodis_on_left_side_or_on_line

Returns `true` if a point lies on the left side of a line or is on the line itself. For left-handed coordinate systems, this method returns if a poin

src/delaunay_core/line_side_info.rs:44

↓ 5 callersMethodlocate_with_hint_option_core

( &self, point: Point2<<Self::Vertex as HasPosition>::Scalar>, hint: Option<FixedVerte

src/delaunay_core/triangulation_ext.rs:261

↓ 5 callersMethodnum_constraints

Returns the number of constraint edges.

src/cdt.rs:425

↓ 5 callersMethodopposite_vertex

Returns the vertex which lies opposite of this edge. This is equal to calling `self.prev().from()` or `self.next().to()`. Returns `None` if this edge

src/delaunay_core/handles/handle_impls.rs:239

↓ 5 callersFunctionsave_pixmap

(pixmap: Pixmap, name: &str)

examples/interpolation/main.rs:155

↓ 5 callersFunctionset_pixel

(pixmap: &mut Pixmap, x: u32, y: u32, value: Option<f64>)

examples/interpolation/main.rs:82

↓ 5 callersMethodset_relative_padding

(&mut self, relative_padding: f64)

examples/svg_renderer/quicksketch/mod.rs:657

↓ 5 callersMethodvertices

Returns the edge's two vertices. The first vertex is `self.from()`, the second vertex is `self.to()`.

src/delaunay_core/handles/handle_impls.rs:214

↓ 4 callersMethodadjacent_edge

Returns an edge that is adjacent to this face. If this face has multiple adjacent edges, any of them is returned.

src/delaunay_core/handles/handle_impls.rs:605

↓ 4 callersFunctionangle_limit_scenario

(angle_limit_degrees: f64)

examples/svg_renderer/scenario_list.rs:1339

↓ 4 callersFunctionbulk_load_distance_fn

(center: Point2<f64>, position: Point2<f64>)

src/delaunay_core/bulk_load.rs:33

↓ 4 callersFunctioncalculate_outer_faces

( triangulation: &ConstrainedDelaunayTriangulation<V, DE, UE, F, L>, )

src/delaunay_core/refinement.rs:962

↓ 4 callersMethodcenter

Returns the center of this edge.

src/delaunay_core/handles/handle_impls.rs:567

↓ 4 callersFunctioncleanup_isolated_vertex

Vertex removal has two stages: First, the vertex is disconnected from its surroundings (isolated). Then, any edges, faces and the vertex itself that h

src/delaunay_core/dcel_operations.rs:1092

↓ 4 callersFunctioncontained_in_circumference

( v1: Point2<S>, v2: Point2<S>, v3: Point2<S>, p: Point2<S>, )

src/delaunay_core/math.rs:270

↓ 4 callersFunctionconvert_refinement_cdt

(cdt: &mut Cdt)

examples/svg_renderer/scenario_list.rs:1262

↓ 4 callersMethodcw

Returns the next edge in clockwise direction. Note that this assumes that you use a right-handed coordinate system, otherwise the sense of orientatio

src/delaunay_core/handles/handle_impls.rs:281

↓ 4 callersMethoddistance_to_point

(&self, point: Point2<S>)

src/flood_fill_iterator.rs:68

↓ 4 callersMethoddot

(&self, other: Self)

src/point.rs:82

↓ 4 callersMethodedge_entry

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

src/delaunay_core/dcel.rs:214

↓ 4 callersMethodface_data_mut

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

src/delaunay_core/dcel.rs:273

↓ 4 callersMethodget_edges_in_rectangle

Example: Shows all edges (red) that are returned when iterating over a rectangle (teal) # Memory consumption Memory usage is, on average, in O(|conv

src/triangulation.rs:675

↓ 4 callersMethodhandle_legal_edge_split

(&mut self, handles: [FixedDirectedEdgeHandle; 2])

src/cdt.rs:214

↓ 4 callersMethodis_before_edge

Returns `true` if a point's projection is located before an edge. See [DirectedEdgeHandle::project_point](crate::handles::DirectedEdgeHandle::project

src/delaunay_core/math.rs:179

↓ 4 callersMethodis_defined_legal

(&self, edge: FixedUndirectedEdgeHandle)

src/cdt.rs:210

↓ 4 callersMethodis_part_of_convex_hull

Returns `true` if either this edge or its reversed edge is adjacent to the outer face.

src/delaunay_core/handles/handle_impls.rs:319

↓ 4 callersMethodlegalize_vertex

(&mut self, new_handle: FixedVertexHandle)

src/delaunay_core/triangulation_ext.rs:356

↓ 4 callersMethodlength_2

Returns the squared length of this edge.

src/delaunay_core/handles/handle_impls.rs:353

↓ 4 callersMethodlocate_vertex

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

src/triangulation.rs:439

↓ 4 callersMethodnext

(&mut self)

src/intersection_iterator.rs:376

↓ 4 callersMethodnum_all_faces

Returns the number of all faces, including the single outer face, of this triangulation. This is always equal to `triangulation.num_inner_faces() + 1

src/triangulation.rs:262

↓ 4 callersFunctionrandom_points_in_range

(range: f64, size: usize, seed: &[u8; 32])

src/test_utilities.rs:13

↓ 4 callersFunctionround_tuple

(x: f64, y: f64)

examples/svg_renderer/quicksketch/convert.rs:52

↓ 4 callersFunctionshape_iterator_scenario

(use_circle_metric: bool, iterate_vertices: bool)

examples/svg_renderer/scenario_list.rs:920

↓ 4 callersFunctionsplit_edge_when_all_vertices_on_line

( dcel: &mut Dcel<V, DE, UE, F>, edge: FixedDirectedEdgeHandle, new_vertex_handle: FixedVertexHand

src/delaunay_core/dcel_operations.rs:451

↓ 4 callersFunctiontry_bulk_load_cdt

Efficient bulk loading of a constraint delaunay triangulation, including both vertices and constraint edges. See [ConstrainedDelaunayTriangulation::bu

src/delaunay_core/bulk_load.rs:210

↓ 4 callersFunctionuniform_distribution

( seed: [u8; 32], range: S, )

benches/benchmark_utilities.rs:23

↓ 4 callersFunctionvalidate_coordinate

Checks if a coordinate value is suitable for insertion into a Delaunay triangulation. Will return an error if and only if - The absolute value of the

src/delaunay_core/math.rs:97

↓ 4 callersFunctionvalidate_vertex

Checks if a vertex is suitable for insertion into a Delaunay triangulation. A vertex is considered suitable if all of its coordinates are valid. See

src/delaunay_core/math.rs:116

↓ 4 callersMethodwith_angle_limit

See also [ConstrainedDelaunayTriangulation::refine]

src/delaunay_core/refinement.rs:228

↓ 3 callersMethodadd_svg_line

(&mut self, svg: Group, from: Point, to: Point, style: &Style)

examples/svg_renderer/quicksketch/convert.rs:266

↓ 3 callersMethodapply

(&self, group: &mut BenchmarkGroup<WallTime>)

benches/benchmark_utilities.rs:120

↓ 3 callersMethodas_voronoi_face

Returns the voronoi face that corresponds to this vertex of the Delaunay triangulation.

src/delaunay_core/handles/handle_impls.rs:773

↓ 3 callersMethodcan_add_constraint

Checks if a constraint edge can be added. Returns `false` if the line from `from` to `to` intersects another constraint edge.

src/cdt.rs:445

↓ 3 callersFunctioncheck_returned_edges

( cdt: &ConstrainedDelaunayTriangulation<Point2<S>>, edges: &[FixedDirectedEdgeHandle],

src/cdt.rs:2613

↓ 3 callersFunctioncircumcenter

(positions: [Point2<S>; 3])

src/delaunay_core/math.rs:358

↓ 3 callersMethodcircumcircle

Returns the face's circumcircle center and the **squared** radius of the circumcircle. The circumcircle is the unique circle that intersects all thre

src/delaunay_core/handles/handle_impls.rs:663

↓ 3 callersMethodcontains_angle

(&self, angle: FloatOrd<f64>)

src/delaunay_core/bulk_load.rs:762

↓ 3 callersFunctioncreate_new_face_adjacent_to_edge

( dcel: &mut Dcel<V, DE, UE, F>, edge: FixedDirectedEdgeHandle, new_vertex_handle: FixedVertexHand

src/delaunay_core/dcel_operations.rs:297

↓ 3 callersMethodedge_entry_mut

( &mut self, handle: FixedHandleImpl<UndirectedEdgeTag, InnerOuter>, )

src/delaunay_core/dcel.rs:221

← previous next →101–200 of 805, ranked by callers