Struct SphericalVoronoi 

pub struct SphericalVoronoi { /* private fields */ }

SphericalVoronoi calculates a Voronoi diagram on the surface of a sphere.

Examples

// Create points on a sphere (these should be normalized)
// Using points that avoid degenerate simplices
let angles = [(0.5_f64, 0.0_f64), (0.5_f64, 1.0_f64), (1.0_f64, 0.5_f64),
             (1.5_f64, 1.0_f64), (0.8_f64, 1.5_f64)];
let mut points = Vec::new();
for &(phi, theta) in angles.iter() {
    let x = phi.sin() * theta.cos();
    let y = phi.sin() * theta.sin();
    let z = phi.cos();
    points.push([x, y, z]);
}
let points = ndarray::arr2(&points);

// Create a SphericalVoronoi diagram
let radius = 1.0;
let center = array![0.0, 0.0, 0.0];
let sv = SphericalVoronoi::new(&points.view(), radius, Some(&center), None)?;

// Access the Voronoi regions
let regions = sv.regions();
println!("Number of regions: {}", regions.len());

// Access the Voronoi vertices
let vertices = sv.vertices();
println!("Number of vertices: {}", vertices.nrows());

Implementations

impl SphericalVoronoi

pub fn new( points: &ArrayView2<'_, f64>, radius: f64, center: Option<&Array1<f64>>, threshold: Option<f64>, ) -> SpatialResult<Self>

Creates a new SphericalVoronoi diagram from points on a sphere.

Arguments

• points - Coordinates of points from which to construct the diagram. These points should be on the surface of the sphere.
• radius - Radius of the sphere.
• center - Center of the sphere. If None, the origin will be used.
• threshold - Threshold for detecting duplicate points and mismatches between points and sphere parameters. If None, 1e-6 is used.

Returns

Returns a Result containing the SphericalVoronoi object if successful, or an error if the input is invalid.

pub fn points(&self) -> &Array2<f64>

Returns the input points.

pub fn vertices(&self) -> &Array2<f64>

Returns the Voronoi vertices.

pub fn regions(&self) -> &Vec<Vec<usize>>

Returns the Voronoi regions as lists of vertex indices.

pub fn radius(&self) -> f64

Returns the radius of the sphere.

pub fn center(&self) -> &Array1<f64>

Returns the center of the sphere.

pub fn simplices(&self) -> &[Vec<usize>]

Returns the Delaunay simplices (triangulations on the sphere).

pub fn circumcenters(&self) -> &Array2<f64>

Returns the circumcenters of the Delaunay triangulations.

pub fn sort_vertices_of_regions(&mut self) -> SpatialResult<()>

Sorts the vertices of each Voronoi region in a counterclockwise order. This is useful for visualization purposes.

pub fn calculate_areas(&mut self) -> SpatialResult<&[f64]>

Calculates the areas of the Voronoi regions.

For 3D point sets, the sum of all areas will be 4π * radius².

pub fn areas(&mut self) -> SpatialResult<&[f64]>

Returns pre-calculated areas of Voronoi regions, or calculates them if not already available.

pub fn geodesic_distance( &self, point1: &ArrayView1<'_, f64>, point2: &ArrayView1<'_, f64>, ) -> SpatialResult<f64>

Calculate the geodesic distance between two points on the sphere.

Arguments

• point1 - First point on the sphere
• point2 - Second point on the sphere

Returns

The geodesic distance (great-circle distance) between the two points

pub fn geodesic_distances_to_generators( &self, point: &ArrayView1<'_, f64>, ) -> SpatialResult<Vec<f64>>

Calculate geodesic distances from a point to all generators.

Arguments

• point - Query point on the sphere

Returns

A vector of distances from the query point to all generator points

pub fn nearest_generator( &self, point: &ArrayView1<'_, f64>, ) -> SpatialResult<(usize, f64)>

Find the nearest generator point to a query point.

Arguments

• point - Query point on the sphere

Returns

The index of the nearest generator point and its geodesic distance

Trait Implementations

impl Debug for SphericalVoronoi

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

Formats the value using the given formatter.