A generic interface for spatial division algorithms (octree, quadtree) More...

#include <ndim_tree.h>

Public Types
using	aabb_type = detail::range_t< n >

using	node_array = std::array< ndim_tree,(1<< n)>

using	item_checker = std::function< bool(size_t, const aabb_type &aabb)>

Public Member Functions
	ndim_tree (size_t depth, const item_checker &callback, const util::aligned::vector< size_t > &to_test, const aabb_type &aabb)

aabb_type	get_aabb () const

bool	has_nodes () const

const node_array &	get_nodes () const

util::aligned::vector< size_t >	get_items () const

size_t	get_side () const

Detailed Description

A generic interface for spatial division algorithms (octree, quadtree)

Member Typedef Documentation

template<size_t n>

using wayverb::core::ndim_tree< n >::item_checker = std::function<bool(size_t, const aabb_type& aabb)>

Given the index of an item, and a bounding box, returns whether or not the item intersects with the box.

The documentation for this class was generated from the following file: