diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2009-04-15 05:54:07 +0000 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2009-04-15 05:54:07 +0000 |
| commit | c74496098446ace1c1fcef183d43d6947815f1db (patch) | |
| tree | 43a1173bae9cb464141f8e30543bc93fe20dbf5a /unsupported/Eigen/BVH | |
| parent | 6ee4eb94fba780f45942dd97952174e8eda4e7eb (diff) | |
patch from Ilya Baran: This small patch fixes a potential initialization
bug in BVAlgorithms and slightly corrects the BVH doc.
Diffstat (limited to 'unsupported/Eigen/BVH')
| -rw-r--r-- | unsupported/Eigen/BVH | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/unsupported/Eigen/BVH b/unsupported/Eigen/BVH index 4fda52b97..39ec9e1b0 100644 --- a/unsupported/Eigen/BVH +++ b/unsupported/Eigen/BVH @@ -54,8 +54,8 @@ namespace Eigen { * - Determine all points where a ray intersects a triangle mesh * - Given a set of points, determine which are contained in a query sphere * - Given a set of spheres, determine which contain the query point - * - Given a set of spheres, determine if any is completely contained in a query box (not an intersection query, - but can still be accelerated by pruning all spheres that do not intersect the query box) + * - Given a set of disks, determine if any is completely contained in a query rectangle (represent each 2D disk as a point \f$(x,y,r)\f$ + * in 3D and represent the rectangle as a pyramid based on the original rectangle and shrinking in the \f$r\f$ direction) * - Given a set of points, count how many pairs are \f$d\pm\epsilon\f$ apart (done by looking at the cartesian product of the set * of points with itself) * |