Struct StaticIcosphere 

pub struct StaticIcosphere<T: IcosphereVertex> {
    pub vertices: Vec<T>,
    pub triangles: Vec<[u32; 3]>,
    pub neighbors: HashMap<usize, HashSet<usize>>,
    pub binning_depth: usize,
    /* private fields */
}

A sphere-like shape constructed by subdividing a regular icosahedron and normalizing the resulting coordinates.

All vertices and triangles are constructed for the entire shape upon creation. This can take huge amounts of memory at high subdivisions. If you want to construct the triangles and vertices on-the-fly to save memory, use a SparseIcosphere.

Fields

vertices: Vec<T>

The vertices may be in any order, don’t rely on the order of this list.

triangles: Vec<[u32; 3]>

Starting from the triangles of the regular icosahedron, each subdivision splits these triangles into groups of four. These four triangles are always contiguous and are indexed by the index of the parent icosahedron. For example, given the index parent_triangle, the four child triangles are located at parent_triangle..parent_triangle + 4.

When rendering, if chunks are necessary, treat these groups of triangles as chunks.

neighbors: HashMap<usize, HashSet<usize>>

For each vertex, this contains the five or six neighbor vertices.

binning_depth: usize

Number of subdivisions from the regular icosahedron

Implementations

impl<T: IcosphereVertex> StaticIcosphere<T>

pub fn regular() -> Self

The regular icosahedron of binning depth 0.

pub fn nth(binning_depth: usize) -> Self

Trait Implementations

impl<T: Clone + IcosphereVertex> Clone for StaticIcosphere<T>

fn clone(&self) -> StaticIcosphere<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + IcosphereVertex> Debug for StaticIcosphere<T>

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

Formats the value using the given formatter.

impl<T: IcosphereVertex> Icosphere<T> for StaticIcosphere<T>

fn subdivide_chunk(&mut self, _previous: &Self, _parent_index: usize) -> bool

Doesn’t do anything because static icospheres are already fully subdivided.

fn create(binning_depth: usize) -> Self

A constructor. If the icosphere is sparse, this may create an empty one

fn binning_depth(&self) -> usize

The number of subdivisions from the regular icosahedron.

fn triangle(&self, triangle_index: usize) -> [u32; 3]

Triangle at the given index.

fn vertices(&self) -> &[T]

List of vertices.

fn total_triangle_count(&self) -> usize

The total possible triangle count in an icosphere with the current binning depth.

fn total_vertex_count(&self) -> usize

The total possible vertex count in an icosphere with the current binning depth.

fn subdivide(&self) -> Self

Subdivide the entire icosphere.

fn allocated_triangle_count(&self) -> usize

The amount of triangles actually in memory. If this icosphere is not sparse, this is equal to the total triangle count.

fn allocated_vertex_count(&self) -> usize

The amount of vertices actually in memory. If this is icosphere is not sparse, this is equal to the total vertex count.

fn approximate_triangle_surface_area(&self, radius: f32) -> f32

Approximates the surface area of a triangle by dividing the sphere’s surface area with the number of triangles.