123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138 |
- // David Eberly, Geometric Tools, Redmond WA 98052
- // Copyright (c) 1998-2020
- // Distributed under the Boost Software License, Version 1.0.
- // https://www.boost.org/LICENSE_1_0.txt
- // https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
- // Version: 4.0.2019.08.13
- #pragma once
- #include <Mathematics/Vector.h>
- // A box has center C, axis directions U[i], and extents e[i]. The set
- // {U[0],...,U[N-1]} is orthonormal, which means the vectors are
- // unit-length and mutually perpendicular. The extents are nonnegative;
- // zero is allowed, meaning the box is degenerate in the corresponding
- // direction. A point X is represented in box coordinates by
- // X = C + y[0]*U[0] + y[1]*U[1]. This point is inside or on the
- // box whenever |y[i]| <= e[i] for all i.
- namespace WwiseGTE
- {
- template <int N, typename Real>
- class OrientedBox
- {
- public:
- // Construction and destruction. The default constructor sets the
- // center to (0,...,0), axis d to Vector<N,Real>::Unit(d) and
- // extent d to +1.
- OrientedBox()
- {
- center.MakeZero();
- for (int i = 0; i < N; ++i)
- {
- axis[i].MakeUnit(i);
- extent[i] = (Real)1;
- }
- }
- OrientedBox(Vector<N, Real> const& inCenter,
- std::array<Vector<N, Real>, N> const& inAxis,
- Vector<N, Real> const& inExtent)
- :
- center(inCenter),
- axis(inAxis),
- extent(inExtent)
- {
- }
- // Compute the vertices of the box. If index i has the bit pattern
- // i = b[N-1]...b[0], then
- // vertex[i] = center + sum_{d=0}^{N-1} sign[d] * extent[d] * axis[d]
- // where sign[d] = 2*b[d] - 1.
- void GetVertices(std::array<Vector<N, Real>, (1 << N)>& vertex) const
- {
- unsigned int const dsup = static_cast<unsigned int>(N);
- std::array<Vector<N, Real>, N> product;
- for (unsigned int d = 0; d < dsup; ++d)
- {
- product[d] = extent[d] * axis[d];
- }
- int const imax = (1 << N);
- for (int i = 0; i < imax; ++i)
- {
- vertex[i] = center;
- for (unsigned int d = 0, mask = 1; d < dsup; ++d, mask <<= 1)
- {
- Real sign = (i & mask ? (Real)1 : (Real)-1);
- vertex[i] += sign * product[d];
- }
- }
- }
- // Public member access. It is required that extent[i] >= 0.
- Vector<N, Real> center;
- std::array<Vector<N, Real>, N> axis;
- Vector<N, Real> extent;
- public:
- // Comparisons to support sorted containers.
- bool operator==(OrientedBox const& box) const
- {
- return center == box.center && axis == box.axis && extent == box.extent;
- }
- bool operator!=(OrientedBox const& box) const
- {
- return !operator==(box);
- }
- bool operator< (OrientedBox const& box) const
- {
- if (center < box.center)
- {
- return true;
- }
- if (center > box.center)
- {
- return false;
- }
- if (axis < box.axis)
- {
- return true;
- }
- if (axis > box.axis)
- {
- return false;
- }
- return extent < box.extent;
- }
- bool operator<=(OrientedBox const& box) const
- {
- return !box.operator<(*this);
- }
- bool operator> (OrientedBox const& box) const
- {
- return box.operator<(*this);
- }
- bool operator>=(OrientedBox const& box) const
- {
- return !operator<(box);
- }
- };
- // Template aliases for convenience.
- template <typename Real>
- using OrientedBox2 = OrientedBox<2, Real>;
- template <typename Real>
- using OrientedBox3 = OrientedBox<3, Real>;
- }
|