aboutsummaryrefslogtreecommitdiffhomepage
path: root/unsupported/Eigen/BVH
diff options
context:
space:
mode:
Diffstat (limited to 'unsupported/Eigen/BVH')
-rw-r--r--unsupported/Eigen/BVH2
1 files changed, 0 insertions, 2 deletions
diff --git a/unsupported/Eigen/BVH b/unsupported/Eigen/BVH
index 7b9c3c7c6..f307da2f7 100644
--- a/unsupported/Eigen/BVH
+++ b/unsupported/Eigen/BVH
@@ -94,8 +94,6 @@ namespace Eigen {
* responsibility of the intersectObject function to keep track of the results in whatever manner is appropriate.
* The cartesian product intersection and the BVMinimize queries are similar--see their individual documentation.
*
- * \addexample BVH_Example \label How to use a BVH to find the closest pair between two point sets
- *
* The following is a simple but complete example for how to use the BVH to accelerate the search for a closest red-blue point pair:
* \include BVH_Example.cpp
* Output: \verbinclude BVH_Example.out