/usr/include/tulip/OcclusionTest.h is in libtulip-dev 4.4.0dfsg2-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
///@cond DOXYGEN_HIDDEN
#ifndef Tulip_OCCLUSIONTEST_H
#define Tulip_OCCLUSIONTEST_H
#ifndef DOXYGEN_NOTFOR_DEVEL
#include <vector>
#include <tulip/Rectangle.h>
namespace tlp {
typedef Rectangle<int> RectangleInt2D;
/**
* @brief Manage a set of non overlapping 2D Axis Aligned Bounding Box
*
* That class enables to store a set of non overlapping 2D AABB.
*
* @todo Use the Tulip quadtree to store AABB and thus speedup testRectangle function
*/
struct TLP_GL_SCOPE OcclusionTest {
std::vector<RectangleInt2D> data;
/**
* Remove all 2D AABB previously added.
*/
void clear() {
data.clear();
}
/**
* Add a new 2D AABB to the set of non overlapping AABB
* if that AABB intersect with AABB already inserted,
* the AABB is not inserted.
*
* @return true if the AABB is inserted else false.
*
*/
bool addRectangle(const RectangleInt2D &rec) {
if (!testRectangle(rec)) {
data.push_back(rec);
return true;
}
return false;
}
/**
* @brief test wehter or nor the AABB intersect with a AABB already inserted.
*
* @return true is the ABBB intersect else false.
*/
bool testRectangle(const RectangleInt2D &rec) {
bool intersect=false;
for (std::vector<RectangleInt2D>::const_iterator it=data.begin(); it!=data.end(); ++it) {
if (rec.intersect(*it)) {
intersect=true;
break;
}
}
return intersect;
}
};
}
#endif //DOXYGEN_NOTFOR_DEVEL
#endif
///@endcond
|