Struct veloren_world::site2::plot::gnarling::Tunnels

struct Tunnels {
    start: Vec3<i32>,
    end: Vec3<i32>,
    branches: Vec<(Vec3<i32>, Vec3<i32>)>,
    path: Vec<Vec3<i32>>,
    terminals: Vec<Vec3<i32>>,
}

Fields

start: Vec3<i32>

end: Vec3<i32>

branches: Vec<(Vec3<i32>, Vec3<i32>)>

path: Vec<Vec3<i32>>

terminals: Vec<Vec3<i32>>

Implementations

impl Tunnels

fn new<F>( start: Vec3<i32>, end: Vec3<i32>, is_valid_edge: F, radius_range: (f32, f32), rng: &mut impl Rng, ) -> Option<Self>

where F: Fn(Vec3<i32>, Vec3<i32>) -> bool,

Attempts to find a path from a start to the end using a rapidly exploring random tree (RRT). A point is sampled from an AABB extending slightly beyond the start and end in the x and y axes and below the start in the z axis to slightly below the end. Nodes are stored in a k-d tree for quicker nearest node calculations. A maximum of 7000 points are sampled until the tree connects the start to the end. A final path is then reconstructed from the nodes. Returns a Tunnels struct of the RRT branches, the complete path, and the location of dead ends. Each branch is a tuple of the start and end locations of each segment. The path is a vector of all the nodes along the complete path from the start to the end.

Trait Implementations

impl Default for Tunnels

fn default() -> Tunnels

Returns the “default value” for a type.