Struct hexasphere::Hexasphere

pub struct Hexasphere<T> { /* fields omitted */ }

Hexagonally tiled sphere. Created with the new method.

Points are represented as the triangular subdivisions of the faces of an icosahedron, the dual of which creates a hexagonally tiled sphere with 12 pentagons. The number of subdivisions is exactly equal to the number of hexagons between adjacent pentagons.

Points are stored in normalized space, on the surface of a unit sphere. The initial points are spherically interpolated to preserve accuracy, and not distort due to projections such as linear interpolation and then normalization.

Implementations

impl<T> Hexasphere<T>

pub fn new(subdivisions: usize, generator: impl FnMut(Vec3A) -> T) -> Self

Creates a hexagonally tiled sphere.

The number of hexagons between pentagons is subdivisions, and generator permits you to create a unique value for every point on the sphere.

pub fn raw_points(&self) -> &[Vec3A]

pub fn get_indices(&self, triangle: usize, buffer: &mut Vec<u32>)

Appends the indices for the triangle into buffer.

pub fn subdivisions(&self) -> usize

pub fn raw_data(&self) -> &[T]

pub fn indices_per_main_triangle(&self) -> usize

Calculate the number of indices which each main triangle will add to the vertex buffer.

Equation

(subdivisions + 1)²

pub fn vertices_per_main_triangle_shared(&self) -> usize

Calculate the number of vertices contained within each main triangle including the vertices which are shared with another main triangle.

Equation

(subdivisions + 1) * (subdivisions + 2) / 2

pub fn vertices_per_main_triangle_unique(&self) -> usize

Calculate the number of vertices contained within each main triangle excluding the ones that are shared with other main triangles.

Equation

{
{ subdivisions < 2  : 0
{
{ subdivisions >= 2 : (subdivisions - 1) * subdivisions / 2
{

pub fn shared_vertices(&self) -> usize

Calculate the number of vertices along the edges of the main triangles and the vertices of the main triangles.

Equation

subdivisions * 30 + 12