diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2009-09-03 11:22:42 +0200 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2009-09-03 11:22:42 +0200 |
| commit | 9515b00876ab8e84ae4beb61e8661400ebb49522 (patch) | |
| tree | 39096a0e55c14bc5056270f2951463032ae3d538 /unsupported/Eigen/BVH | |
| parent | 16c7b1daabd2697950605706a8bc68ae32d70fc8 (diff) | |
remove the \addexample tags
Diffstat (limited to 'unsupported/Eigen/BVH')
| -rw-r--r-- | unsupported/Eigen/BVH | 2 |
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 |