Struct hexasphere::SquareBase

pub struct SquareBase;

Implements a square as the base shape.

• 4 vertices
• 2 faces
• 5 edges

This is a square on the XZ plane. The circumscribed circle on the square has radius 1.0. This is done to preserve the accuracy of the subdivisions at higher levels of subdivision.

Trait Implementations

impl BaseShape for SquareBase

fn initial_points() -> &'static [Vec3A]

The initial vertices for the triangle. Note that Vec3A::new is not a const fn(), hence I recommend you use lazy_static. Check the source file for this crate and look for the constants module at the bottom for an example.

fn triangles() -> &'static [Triangle]

Base triangles for the shape.

const EDGES: usize

Number of unique edges defined in the contents of triangles(). This number is 5 for a square for example: text a - 0 - b | / | 3 4 1 | / | d - 2 - c

fn interpolate(a: Vec3A, b: Vec3A, p: f32) -> Vec3A

Basic function used for interpolation. When p is 0.0, a is expected. When p is 1.0, b is expected. There are three options already implemented in this crate: - [lerp] implements linear interpolation. - [geometric_slerp] implements spherical interpolation. (Interpolates along an arc on a sphere) - [normalized_lerp] implements cheaper yet less accurate spherical interpolation. The accuracy decreases as the angle between the two points on the unit sphere increases.

fn interpolate_half(a: Vec3A, b: Vec3A) -> Vec3A

If an optimization is available for the case where p is 0.5, this function should implement it. This defaults to calling interpolate(a, b, 0.5) however.

fn interpolate_multiple(
    a: Vec3A,
    b: Vec3A,
    indices: &[u32],
    points: &mut [Vec3A]
)

If an optimization is available for the case where p varies but a and b don't this function should implement it.