Skip to main content

CompoundShape

Struct CompoundShape 

Source
pub struct CompoundShape {
    pub children: Vec<CompoundChild>,
}
Expand description

A compound shape made of multiple lightweight primitive children.

Unlike Compound which uses Arc<dyn Shape>, this uses concrete enum variants for common shapes, avoiding dynamic dispatch and allocations.

Fields§

§children: Vec<CompoundChild>

The child shapes.

Implementations§

Source§

impl CompoundShape

Source

pub fn new() -> Self

Create an empty compound shape.

Source

pub fn add_sphere(&mut self, center: [f64; 3], radius: f64)

Add a sphere child.

Source

pub fn add_box(&mut self, center: [f64; 3], half_extents: [f64; 3])

Add a box child.

Source

pub fn add_capsule(&mut self, center: [f64; 3], radius: f64, half_height: f64)

Add a capsule child.

Source

pub fn child_count(&self) -> usize

Return the number of children.

Source

pub fn total_volume(&self) -> f64

Compute total volume of all children (no overlap correction).

Source

pub fn aabb(&self) -> ([f64; 3], [f64; 3])

Compute axis-aligned bounding box of all children.

Returns (min, max) as [f64; 3] arrays.

Source

pub fn center_of_mass(&self) -> [f64; 3]

Compute volume-weighted center of mass.

Source

pub fn contains_point(&self, p: [f64; 3]) -> bool

Test if a point is inside any child shape.

Source

pub fn ray_cast( &self, origin: [f64; 3], dir: [f64; 3], max_toi: f64, ) -> Option<(f64, [f64; 3], usize)>

Ray cast against all children, returning (toi, normal, child_index) for the closest hit within max_toi.

Source§

impl CompoundShape

Source

pub fn inertia_tensor(&self, density: f64) -> [[f64; 3]; 3]

Compute the inertia tensor of the compound shape about its center of mass.

Uses the parallel axis theorem. density is the uniform mass density.

Source

pub fn bounding_sphere(&self) -> ([f64; 3], f64)

Compute the bounding sphere (center, radius) of the compound shape.

Source

pub fn scale(&mut self, factor: f64)

Apply a uniform scaling to all child shape positions and sizes.

Source

pub fn translate(&mut self, offset: [f64; 3])

Translate all child centers by the given offset.

Source

pub fn merge_with(&self, other: &CompoundShape) -> CompoundShape

Returns a new compound shape merged with another (concatenation of children).

Source

pub fn overlaps_sphere(&self, center: [f64; 3], radius: f64) -> bool

Compute the overlap (intersection test) with a sphere at center with radius.

Returns true if any child overlaps the query sphere.

Source

pub fn ray_cast_all( &self, origin: [f64; 3], dir: [f64; 3], max_toi: f64, ) -> Vec<(f64, [f64; 3], usize)>

Recursively ray-cast with early exit once max_hits are found.

Source§

impl CompoundShape

Source

pub fn merged_aabb(&self) -> ([f64; 3], [f64; 3])

Compute merged AABB over all children.

Source

pub fn raycast( &self, ray_origin: [f64; 3], ray_dir: [f64; 3], max_t: f64, ) -> Option<(f64, usize)>

Ray cast returning (t, child_index) for the closest hit within max_t.

Unlike ray_cast this omits the normal to match the requested signature.

Source

pub fn volume(&self) -> f64

Total volume of all children (sum of child volumes).

Source

pub fn center_of_mass_weighted(&self, masses: &[f64]) -> [f64; 3]

Mass-weighted center of mass.

masses[i] is the mass of child i. If masses is shorter than children, remaining children have zero mass.

Source

pub fn inertia_tensor_from_masses(&self, masses: &[f64]) -> [[f64; 3]; 3]

Inertia tensor about the compound center of mass using the parallel axis theorem.

masses[i] is the mass of child i.

Source

pub fn closest_point(&self, p: [f64; 3]) -> ([f64; 3], usize)

Closest surface point to p among all children.

Returns (closest_point, child_index).

Source§

impl CompoundShape

Source

pub fn remove_child(&mut self, index: usize)

Remove the child at the given index. Panics if index is out of range.

Source

pub fn swap_remove_child(&mut self, index: usize)

Remove the child at the given index by swapping with the last element.

Faster than remove_child (O(1) vs O(n)) but changes the order of remaining children.

Source

pub fn replace_with_sphere( &mut self, index: usize, center: [f64; 3], radius: f64, )

Replace the child at index with a new sphere.

Source

pub fn replace_with_box( &mut self, index: usize, center: [f64; 3], half_extents: [f64; 3], )

Replace the child at index with a new box.

Source

pub fn is_empty(&self) -> bool

Return true if the compound shape has no children.

Source

pub fn clear(&mut self)

Clear all children.

Source

pub fn closest_point_with_dist2(&self, p: [f64; 3]) -> ([f64; 3], f64, usize)

Closest surface point among all children together with the squared distance and the child index.

Returns (closest_point, squared_distance, child_index).

Source

pub fn broad_phase_pairs(&self, other: &CompoundShape) -> Vec<(usize, usize)>

Check if two CompoundShape instances have any overlapping pair of children using conservative bounding-sphere overlap tests.

Returns the index pairs (i, j) of all overlapping child pairs.

Source

pub fn overlaps_compound(&self, other: &CompoundShape) -> bool

Test if two CompoundShape instances overlap at all (broad phase).

Source

pub fn centroid_with_densities(&self, densities: &[f64]) -> [f64; 3]

Compute the centroid of the compound (volume-weighted center) using per-child densities.

densities[i] is the density for child i. If densities is shorter than children, remaining children use density 1.0.

Source

pub fn penetration_depth_sphere( &self, center: [f64; 3], radius: f64, ) -> Option<(f64, usize)>

Approximate penetration depth between this compound and a sphere at center with radius.

For each child, computes the signed distance to the child’s surface (negative inside). Returns the minimum signed distance (most negative = deepest penetration) together with the child index.

Returns None if there is no penetration.

Source

pub fn child_masses(&self, density: f64) -> Vec<f64>

Compute per-child masses from a uniform density.

Source

pub fn total_mass(&self, density: f64) -> f64

Total mass of the compound given uniform density.

Source

pub fn child_aabb_public(child: &CompoundChild) -> ([f64; 3], [f64; 3])

Axis-aligned bounding box of a single child (public accessor).

Source

pub fn expanded_aabb(&self, margin: f64) -> ([f64; 3], [f64; 3])

Compute the AABB expanded by a margin margin on all sides.

Source

pub fn sphere_overlaps_aabb(&self, center: [f64; 3], radius: f64) -> bool

Test if a sphere (center, radius) overlaps the compound’s AABB.

Trait Implementations§

Source§

impl Clone for CompoundShape

Source§

fn clone(&self) -> CompoundShape

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for CompoundShape

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for CompoundShape

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.