|
|
using | Scalar = typename VertexArray::Scalar |
| |
|
using | Index = typename EdgeArray::Scalar |
| |
|
using | AlignedBoxType = typename AABB<Scalar, Dim>::Box |
| |
|
using | RowVectorType = Eigen::Matrix<Scalar, 1, Dim> |
| |
|
using | ActionCallback = function_ref<void(Scalar, Index, const RowVectorType&)> |
| | closest_sq_dist x element_id x closest_point
|
| |
|
| | EdgeAABBTree (const VertexArray &V, const EdgeArray &E) |
| | Construct an AABB over the given edge graph.
|
| |
| bool | empty () const |
| | Test whether the tree is empty.
|
| |
| void | get_element_closest_point (const RowVectorType &p, Index element_id, RowVectorType &closest_point, Scalar &closest_sq_dist) const |
| | Gets the closest point to a given element.
|
| |
| void | foreach_element_in_radius (const RowVectorType &p, Scalar sq_dist, ActionCallback func) const |
| | Iterate over edges within a prescribed distance from a query point.
|
| |
| void | foreach_element_containing (const RowVectorType &p, ActionCallback func) const |
| | Iterate over edges that contain exactly a given query point.
|
| |
| void | get_closest_point (const RowVectorType &p, Index &element_id, RowVectorType &closest_point, Scalar &closest_sq_dist, function_ref< bool(Index)> filter_func=[](Index) { return true;}) const |
| | Gets the closest point to an element of the tree.
|
| |
The documentation for this struct was generated from the following files: