Struct ObserverVisibilityCache

pub struct ObserverVisibilityCache { /* private fields */ }

Volumetric visibility cache based on occlusion query.

Implementations

impl ObserverVisibilityCache

pub fn new(granularity: Vector3<u32>, distance_discard_threshold: f32) -> Self

Creates new visibility cache with the given granularity and distance discard threshold. Granularity in means how much the cache should subdivide the world. For example 2 means that 1 meter cell will be split into 8 blocks by 0.5 meters. Distance discard threshold means how far an observer can without discarding visibility info about distant objects.

pub fn world_to_grid(&self, world_position: Vector3<f32>) -> Vector3<i32>

Transforms the given world-space position into internal grid-space position.

pub fn grid_to_world(&self, grid_position: Vector3<i32>) -> Vector3<f32>

Transforms the given grid-space position into the world-space position.

pub fn needs_occlusion_query( &self, observer_position: Vector3<f32>, node: Handle<Node>, ) -> bool

Checks whether the given object needs an occlusion query for the given observer position.

pub fn is_visible( &self, observer_position: Vector3<f32>, node: Handle<Node>, ) -> bool

Checks whether the object at the given handle is visible from the given observer position. This method returns true for non-completed occlusion queries, because occlusion query is async operation.

pub fn begin_query( &mut self, server: &dyn GraphicsServer, observer_position: Vector3<f32>, node: Handle<Node>, ) -> Result<(), FrameworkError>

Begins a new visibility query (using occlusion query) for the object at the given handle from the given observer position.

pub fn end_query(&mut self)

Ends the last visibility query.

pub fn update(&mut self, observer_position: Vector3<f32>)

This method removes info about too distant objects and processes the pending visibility queries.

Trait Implementations

impl Debug for ObserverVisibilityCache

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

Formats the value using the given formatter.