pub struct ObjLod {
pub levels: Vec<ObjMesh>,
pub thresholds: Vec<f64>,
}Expand description
A level-of-detail collection: multiple meshes at decreasing resolution.
Fields§
§levels: Vec<ObjMesh>LOD levels, index 0 = highest detail.
thresholds: Vec<f64>Distance thresholds at which to switch to the next LOD level.
thresholds[i] is the max distance for levels[i].
Implementations§
Source§impl ObjLod
impl ObjLod
Sourcepub fn push(&mut self, mesh: ObjMesh, threshold: f64)
pub fn push(&mut self, mesh: ObjMesh, threshold: f64)
Add a LOD level with the given switch distance.
Sourcepub fn select(&self, distance: f64) -> Option<&ObjMesh>
pub fn select(&self, distance: f64) -> Option<&ObjMesh>
Select the appropriate LOD level for a viewing distance.
Sourcepub fn num_levels(&self) -> usize
pub fn num_levels(&self) -> usize
Number of LOD levels.
Sourcepub fn decimate(mesh: &ObjMesh, target_faces: usize) -> ObjMesh
pub fn decimate(mesh: &ObjMesh, target_faces: usize) -> ObjMesh
Simplify a mesh to approximately target_faces triangles using
Quadric Error Metric (QEM) edge-collapse.
Implements the Garland–Heckbert (1997) algorithm:
- Compute per-face error quadrics from plane equations.
- Sum quadrics at each vertex.
- For every edge, compute the optimal collapse target position and its associated cost.
- Greedily collapse the minimum-cost edge until
target_facesis reached, using a lazy-deletion min-heap.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ObjLod
impl RefUnwindSafe for ObjLod
impl Send for ObjLod
impl Sync for ObjLod
impl Unpin for ObjLod
impl UnsafeUnpin for ObjLod
impl UnwindSafe for ObjLod
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.