/usr/include/ignition/math2/ignition/math/Box.hh is in libignition-math2-dev 2.9.0+dfsg1-1.
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 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 | /*
* Copyright (C) 2012-2014 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef IGNITION_MATH_BOX_HH_
#define IGNITION_MATH_BOX_HH_
#include <iostream>
#include <tuple>
#include <ignition/math/Helpers.hh>
#include <ignition/math/Vector3.hh>
#include <ignition/math/Line3.hh>
namespace ignition
{
namespace math
{
// Forward declaration of private data
class BoxPrivate;
/// \class Box Box.hh ignition/math/Box.hh
/// \brief Mathematical representation of a box and related functions.
class IGNITION_VISIBLE Box
{
/// \brief Default constructor
public: Box();
/// \brief Constructor. This constructor will compute the box's
/// minimum and maximum corners based on the two arguments.
/// \param[in] _vec1 One corner of the box
/// \param[in] _vec2 Another corner of the box
public: Box(const Vector3d &_vec1, const Vector3d &_vec2);
/// \brief Constructor. This constructor will compute the box's
/// minimum and maximum corners based on the arguments.
/// \param[in] _vec1X One corner's X position
/// \param[in] _vec1Y One corner's Y position
/// \param[in] _vec1Z One corner's Z position
/// \param[in] _vec2X Other corner's X position
/// \param[in] _vec2Y Other corner's Y position
/// \param[in] _vec2Z Other corner's Z position
public: Box(double _vec1X, double _vec1Y, double _vec1Z,
double _vec2X, double _vec2Y, double _vec2Z);
/// \brief Copy Constructor
/// \param[in] _b Box to copy
public: Box(const Box &_b);
/// \brief Destructor
public: virtual ~Box();
/// \brief Get the length along the x dimension
/// \return Double value of the length in the x dimension
public: double XLength() const;
/// \brief Get the length along the y dimension
/// \return Double value of the length in the y dimension
public: double YLength() const;
/// \brief Get the length along the z dimension
/// \return Double value of the length in the z dimension
public: double ZLength() const;
/// \brief Get the size of the box
/// \return Size of the box
public: math::Vector3d Size() const;
/// \brief Get the box center
/// \return The center position of the box
public: math::Vector3d Center() const;
/// \brief Merge a box with this box
/// \param[in] _box Box to add to this box
public: void Merge(const Box &_box);
/// \brief Assignment operator. Set this box to the parameter
/// \param[in] _b Box to copy
/// \return The new box.
public: Box &operator=(const Box &_b);
/// \brief Addition operator. result = this + _b
/// \param[in] _b Box to add
/// \return The new box
public: Box operator+(const Box &_b) const;
/// \brief Addition set operator. this = this + _b
/// \param[in] _b Box to add
/// \return This new box
public: const Box &operator+=(const Box &_b);
/// \brief Equality test operator
/// \param[in] _b Box to test
/// \return True if equal
public: bool operator==(const Box &_b) const;
/// \brief Inequality test operator
/// \param[in] _b Box to test
/// \return True if not equal
public: bool operator!=(const Box &_b) const;
/// \brief Subtract a vector from the min and max values
/// \param _v The vector to use during subtraction
/// \return The new box
public: Box operator-(const Vector3d &_v);
/// \brief Output operator
/// \param[in] _out Output stream
/// \param[in] _b Box to output to the stream
/// \return The stream
public: friend std::ostream &operator<<(std::ostream &_out,
const ignition::math::Box &_b)
{
_out << "Min[" << _b.Min() << "] Max[" << _b.Max() << "]";
return _out;
}
/// \brief Get the minimum corner.
/// \return The Vector3d that is the minimum corner of the box.
public: const Vector3d &Min() const;
/// \brief Get the maximum corner.
/// \return The Vector3d that is the maximum corner of the box.
public: const Vector3d &Max() const;
/// \brief Get a mutable version of the minimum corner.
/// \return The Vector3d that is the minimum corner of the box.
public: Vector3d &Min();
/// \brief Get a mutable version of the maximum corner.
/// \return The Vector3d that is the maximum corner of the box.
public: Vector3d &Max();
/// \brief Test box intersection. This test will only work if
/// both box's minimum corner is less than or equal to their
/// maximum corner.
/// \param[in] _box Box to check for intersection with this box.
/// \return True if this box intersects _box.
public: bool Intersects(const Box &_box) const;
/// \brief Check if a point lies inside the box.
/// \param[in] _p Point to check.
/// \return True if the point is inside the box.
public: bool Contains(const Vector3d &_p) const;
/// \brief Check if a ray (origin, direction) intersects the box.
/// \param[in] _origin Origin of the ray.
/// \param[in] _dir Direction of the ray. This ray will be normalized.
/// \param[in] _min Minimum allowed distance.
/// \param[in] _max Maximum allowed distance.
/// \return A boolean
public: bool IntersectCheck(const Vector3d &_origin, const Vector3d &_dir,
const double _min, const double _max) const;
/// \brief Check if a ray (origin, direction) intersects the box.
/// \param[in] _origin Origin of the ray.
/// \param[in] _dir Direction of the ray. This ray will be normalized.
/// \param[in] _min Minimum allowed distance.
/// \param[in] _max Maximum allowed distance.
/// \return A boolean and double tuple. The boolean value is true
/// if the line intersects the box.
///
/// The double is the distance from
/// the ray's start to the closest intersection point on the box,
/// minus the _min distance. For example, if _min == 0.5 and the
/// intersection happens at a distance of 2.0 from _origin then returned
/// distance is 1.5.
///
/// The double value is zero when the boolean value is false.
public: std::tuple<bool, double> IntersectDist(
const Vector3d &_origin, const Vector3d &_dir,
const double _min, const double _max) const;
/// \brief Check if a ray (origin, direction) intersects the box.
/// \param[in] _origin Origin of the ray.
/// \param[in] _dir Direction of the ray. This ray will be normalized.
/// \param[in] _min Minimum allowed distance.
/// \param[in] _max Maximum allowed distance.
/// \return A boolean, double, Vector3d tuple. The boolean value is true
/// if the line intersects the box.
///
/// The double is the distance from the ray's start to the closest
/// intersection point on the box,
/// minus the _min distance. For example, if _min == 0.5 and the
/// intersection happens at a distance of 2.0 from _origin then returned
/// distance is 1.5.
/// The double value is zero when the boolean value is false. The
///
/// Vector3d is the intersection point on the box. The Vector3d value
/// is zero if the boolean value is false.
public: std::tuple<bool, double, Vector3d> Intersect(
const Vector3d &_origin, const Vector3d &_dir,
const double _min, const double _max) const;
/// \brief Check if a line intersects the box.
/// \param[in] _line The line to check against this box.
/// \return A boolean, double, Vector3d tuple. The boolean value is true
/// if the line intersects the box. The double is the distance from
/// the line's start to the closest intersection point on the box.
/// The double value is zero when the boolean value is false. The
/// Vector3d is the intersection point on the box. The Vector3d value
/// is zero if the boolean value is false.
public: std::tuple<bool, double, Vector3d> Intersect(
const Line3d &_line) const;
/// \brief Clip a line to a dimension of the box.
/// This is a helper function to Intersects
/// \param[in] _d Dimension of the box(0, 1, or 2).
/// \param[in] _line Line to clip
/// \param[in,out] _low Close distance
/// \param[in,out] _high Far distance
private: bool ClipLine(const int _d, const Line3d &_line,
double &_low, double &_high) const;
/// \brief Private data pointer
private: BoxPrivate *dataPtr;
};
}
}
#endif
|