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 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt3D module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qbox3d.h"
#include "qplane3d.h"
#include <QtGui/qmatrix4x4.h>
#include <QtCore/qlist.h>
QT_BEGIN_NAMESPACE
/*!
\class QBox3D
\brief The QBox3D class represents an axis-aligned box in 3D space.
\since 4.8
\ingroup qt3d
\ingroup qt3d::math
QBox3D can be used to represent the bounding box of objects in a 3D
scene so that they can be easily culled if they are out of view.
The sides of the box are always aligned with the x, y, and z axes of
the world co-ordinate system. Transforming a box with transformed()
will result in the smallest axis-aligned bounding box that contains
the transformed box.
Boxes may be null, finite, or infinite. A null box does not occupy
any space and does not intersect with any other box. A finite
box consists of a minimum() and maximum() extent in 3D space.
An infinite box encompasses all points in 3D space.
The extents of a finite box are also included within the box.
A box with minimum() and maximum() set to the same value
contains a single point.
*/
/*!
\fn QBox3D::QBox3D()
Constructs a null box in 3D space.
\sa isNull()
*/
/*!
\fn QBox3D::QBox3D(const QVector3D& corner1, const QVector3D& corner2)
Constructs a finite box in 3D space from \a corner1 to \a corner2.
The minimum() and maximum() co-ordinates of the new box are set
to the minimum and maximum x, y, and z values from \a corner1 and
\a corner2. The \a corner1 and \a corner2 values can be any two
opposite corners that define the box.
\sa isFinite(), minimum(), maximum()
*/
/*!
\fn bool QBox3D::isNull() const
Returns true if this box is null; false otherwise.
\sa isFinite(), isInfinite(), setToNull()
*/
/*!
\fn bool QBox3D::isFinite() const
Returns true if this box is finite in size; false otherwise.
\sa isNull(), isInfinite(), setExtents()
*/
/*!
\fn bool QBox3D::isInfinite() const
Returns true if this box is infinite in size; false otherwise.
\sa isNull(), isFinite(), setToInfinite()
*/
/*!
\fn QVector3D QBox3D::minimum() const
Returns the minimum corner of this box.
\sa maximum(), setExtents()
*/
/*!
\fn QVector3D QBox3D::maximum() const
Returns the maximum corner of this box.
\sa minimum(), setExtents()
*/
/*!
\fn void QBox3D::setExtents(const QVector3D& corner1, const QVector3D& corner2)
Sets the extents of this box to a finite region from \a corner1 to
\a corner2. The minimum() and maximum() co-ordinates of the box are
set to the minimum and maximum x, y, and z values from \a corner1 and
\a corner2. The \a corner1 and \a corner2 values can be any two
opposite corners that define the box.
\sa minimum(), maximum()
*/
/*!
\fn void QBox3D::setToNull()
Sets this box to null.
\sa isNull()
*/
/*!
\fn void QBox3D::setToInfinite()
Sets this box to be infinite in size.
\sa isInfinite()
*/
/*!
\fn QVector3D QBox3D::size() const
Returns the finite size of this box. If this box is null or
infinite, the returned value will be zero.
\sa center(), isNull(), isInfinite()
*/
/*!
\fn QVector3D QBox3D::center() const
Returns the finite center of this box. If this box is null
or infinite, the returned value will be zero.
\sa size(), isNull(), isInfinite()
*/
/*!
\fn bool QBox3D::contains(const QVector3D& point) const
Returns true if this box contains \a point; false otherwise.
Null boxes do not contain any points and infinite boxes contain
all points.
Containment is not a strict test: the point is contained if it
lies on one of the faces of the box.
\sa intersects()
*/
/*!
\fn bool QBox3D::contains(const QBox3D& box) const
Returns true if this box completely contains \a box. If this box
is null, then it will not contain \a box. If this box is infinite,
and \a box is not null, then \a box will be contained within this box.
If \a box is infinite, then this box must also be infinite to contain it.
\sa intersects()
*/
/*!
Returns true if \a box intersects this box; false otherwise.
\sa intersect(), intersected(), contains()
*/
bool QBox3D::intersects(const QBox3D& box) const
{
if (boxtype == Null)
return false;
else if (boxtype == Infinite)
return box.boxtype != Null;
else if (box.boxtype == Null)
return false;
else if (box.boxtype == Infinite)
return true;
if (maxcorner.x() < box.mincorner.x())
return false;
if (mincorner.x() > box.maxcorner.x())
return false;
if (maxcorner.y() < box.mincorner.y())
return false;
if (mincorner.y() > box.maxcorner.y())
return false;
if (maxcorner.z() < box.mincorner.z())
return false;
if (mincorner.z() > box.maxcorner.z())
return false;
return true;
}
/*!
Returns true if \a ray intersects this box; false otherwise.
\sa intersection()
*/
bool QBox3D::intersects(const QRay3D &ray) const
{
float minimum_t, maximum_t;
return intersection(ray, &minimum_t, &maximum_t);
}
static inline void trackIntersectionX
(const QBox3D &box, const QRay3D &ray, float t,
float *minimum_t, float *maximum_t, bool *found)
{
QVector3D point = ray.point(t);
if (point.y() < box.minimum().y() || point.y() > box.maximum().y())
return;
if (point.z() < box.minimum().z() || point.z() > box.maximum().z())
return;
if (!(*found)) {
*minimum_t = *maximum_t = t;
*found = true;
} else {
if (t < *minimum_t)
*minimum_t = t;
if (t > *maximum_t)
*maximum_t = t;
}
}
static inline void trackIntersectionY
(const QBox3D &box, const QRay3D &ray, float t,
float *minimum_t, float *maximum_t, bool *found)
{
QVector3D point = ray.point(t);
if (point.x() < box.minimum().x() || point.x() > box.maximum().x())
return;
if (point.z() < box.minimum().z() || point.z() > box.maximum().z())
return;
if (!(*found)) {
*minimum_t = *maximum_t = t;
*found = true;
} else {
if (t < *minimum_t)
*minimum_t = t;
if (t > *maximum_t)
*maximum_t = t;
}
}
static inline void trackIntersectionZ
(const QBox3D &box, const QRay3D &ray, float t,
float *minimum_t, float *maximum_t, bool *found)
{
QVector3D point = ray.point(t);
if (point.x() < box.minimum().x() || point.x() > box.maximum().x())
return;
if (point.y() < box.minimum().y() || point.y() > box.maximum().y())
return;
if (!(*found)) {
*minimum_t = *maximum_t = t;
*found = true;
} else {
if (t < *minimum_t)
*minimum_t = t;
if (t > *maximum_t)
*maximum_t = t;
}
}
/*!
Finds the \a minimum_t and \a maximum_t values where \a ray intersects
this box. Returns true if intersections were found; or false if there
is no intersection.
If \a minimum_t and \a maximum_t are set to the same value, then the
intersection is at a corner or the volume of the box is zero.
If the t values are negative, then the intersection occurs before the
ray's origin point in the reverse direction of the ray.
The \a minimum_t and \a maximum_t values can be passed to QRay3D::point()
to determine the actual intersection points, as shown in the following
example:
\code
float minimum_t, maximum_t;
if (box.intersection(ray, &minimum_t, &maximum_t)) {
qDebug() << "intersections at"
<< ray.point(minimum_t) << "and"
<< ray.point(maximum_t);
}
\endcode
\sa intersects(), QRay3D::point()
*/
bool QBox3D::intersection(const QRay3D &ray, float *minimum_t, float *maximum_t) const
{
bool found = false;
QVector3D origin = ray.origin();
QVector3D direction = ray.direction();
*minimum_t = *maximum_t = qSNaN();
if (boxtype == Finite) {
if (direction.x() != 0.0f) {
trackIntersectionX
(*this, ray, (mincorner.x() - origin.x()) / direction.x(),
minimum_t, maximum_t, &found);
trackIntersectionX
(*this, ray, (maxcorner.x() - origin.x()) / direction.x(),
minimum_t, maximum_t, &found);
}
if (direction.y() != 0.0f) {
trackIntersectionY
(*this, ray, (mincorner.y() - origin.y()) / direction.y(),
minimum_t, maximum_t, &found);
trackIntersectionY
(*this, ray, (maxcorner.y() - origin.y()) / direction.y(),
minimum_t, maximum_t, &found);
}
if (direction.z() != 0.0f) {
trackIntersectionZ
(*this, ray, (mincorner.z() - origin.z()) / direction.z(),
minimum_t, maximum_t, &found);
trackIntersectionZ
(*this, ray, (maxcorner.z() - origin.z()) / direction.z(),
minimum_t, maximum_t, &found);
}
}
return found;
}
/*!
Returns the t value at which \a ray first intersects the sides of
this box, or not-a-number if there is no intersection.
When the \a ray intersects this box, the return value is a
parametric value that can be passed to QRay3D::point() to determine
the actual intersection point, as shown in the following example:
\code
float t = box.intersection(ray);
QVector3D pt;
if (qIsNaN(t)) {
qWarning("no intersection occurred");
else
pt = ray.point(t);
\endcode
The \a ray might intersect at two points - as the ray passes through
the box - one on the near side, one on the far side; where near and far
are relative to the origin point of the ray. This function only
returns the near intersection point.
Only positive values on the ray are considered. This means that if
the origin point of the ray is inside the box, there is only one
solution, not two. To get the other solution, simply change
the sign of the ray's direction vector. If the origin point of
the ray is outside the box, and the direction points away from
the box, then there will be no intersection.
When the ray does not intersect the box in the positive direction,
or the box is not finite, then the return value is not-a-number.
\sa intersects(), QRay3D::point()
*/
float QBox3D::intersection(const QRay3D &ray) const
{
float minimum_t, maximum_t;
if (intersection(ray, &minimum_t, &maximum_t)) {
if (minimum_t >= 0.0f)
return minimum_t;
else if (maximum_t >= 0.0f)
return maximum_t;
else
return qSNaN();
} else {
return qSNaN();
}
}
/*!
Intersects this box with \a box.
\sa intersected(), intersects(), unite()
*/
void QBox3D::intersect(const QBox3D& box)
{
// Handle the simple cases first.
if (boxtype == Null) {
// Null intersected with anything is null.
return;
} else if (boxtype == Infinite) {
// Infinity intersected with a box is that box.
*this = box;
return;
} else if (box.boxtype == Null) {
// Anything intersected with null is null.
setToNull();
return;
} else if (box.boxtype == Infinite) {
// Box intersected with infinity is the box.
return;
}
// Intersect two finite boxes.
QVector3D min1 = mincorner;
QVector3D max1 = maxcorner;
QVector3D min2 = box.mincorner;
QVector3D max2 = box.maxcorner;
if (min2.x() > min1.x())
min1.setX(min2.x());
if (min2.y() > min1.y())
min1.setY(min2.y());
if (min2.z() > min1.z())
min1.setZ(min2.z());
if (max2.x() < max1.x())
max1.setX(max2.x());
if (max2.y() < max1.y())
max1.setY(max2.y());
if (max2.z() < max1.z())
max1.setZ(max2.z());
if (min1.x() > max1.x() || min1.y() > max1.y() || min1.z() > max1.z()) {
setToNull();
} else {
mincorner = min1;
maxcorner = max1;
}
}
/*!
Returns a new box which is the intersection of this box with \a box.
\sa intersect(), intersects(), united()
*/
QBox3D QBox3D::intersected(const QBox3D& box) const
{
QBox3D result(*this);
result.intersect(box);
return result;
}
/*!
Unites this box with \a point by expanding it to encompass \a point.
If \a point is already contained within this box, then this box
will be unchanged.
\sa united(), intersect()
*/
void QBox3D::unite(const QVector3D& point)
{
if (boxtype == Finite) {
if (point.x() < mincorner.x())
mincorner.setX(point.x());
else if (point.x() > maxcorner.x())
maxcorner.setX(point.x());
if (point.y() < mincorner.y())
mincorner.setY(point.y());
else if (point.y() > maxcorner.y())
maxcorner.setY(point.y());
if (point.z() < mincorner.z())
mincorner.setZ(point.z());
else if (point.z() > maxcorner.z())
maxcorner.setZ(point.z());
} else if (boxtype == Null) {
boxtype = Finite;
mincorner = point;
maxcorner = point;
}
}
/*!
Unites this box with \a box by expanding this box to encompass the
region defined by \a box. If \a box is already contained within
this box, then this box will be unchanged.
\sa united(), intersect()
*/
void QBox3D::unite(const QBox3D& box)
{
if (box.boxtype == Finite) {
unite(box.minimum());
unite(box.maximum());
} else if (box.boxtype == Infinite) {
setToInfinite();
}
}
/*!
Returns a new box which unites this box with \a point. The returned
value will be the smallest box that contains both this box and \a point.
\sa unite(), intersected()
*/
QBox3D QBox3D::united(const QVector3D& point) const
{
if (boxtype == Finite) {
QBox3D result(*this);
result.unite(point);
return result;
} else if (boxtype == Null) {
return QBox3D(point, point);
} else {
return *this;
}
}
/*!
Returns a new box which unites this box with \a box. The returned value
will be the smallest box that contains both this box and \a box.
\sa unite(), intersected()
*/
QBox3D QBox3D::united(const QBox3D& box) const
{
if (boxtype == Finite) {
QBox3D result(*this);
result.unite(box);
return result;
} else if (boxtype == Null) {
return box;
} else {
return *this;
}
}
/*!
Transforms this box according to \a matrix. Each of the 8 box
corners are transformed and then a new box that encompasses all
of the transformed corner values is created.
\sa transformed()
*/
void QBox3D::transform(const QMatrix4x4& matrix)
{
*this = transformed(matrix);
}
/*!
Returns this box transformed by \a matrix. Each of the 8 box
corners are transformed and then a new box that encompasses all
of the transformed corner values is returned.
\sa transform()
*/
QBox3D QBox3D::transformed(const QMatrix4x4& matrix) const
{
if (boxtype != Finite)
return *this;
QBox3D result;
result.unite(matrix * mincorner);
result.unite(matrix * QVector3D(mincorner.x(), mincorner.y(), maxcorner.z()));
result.unite(matrix * QVector3D(mincorner.x(), maxcorner.y(), maxcorner.z()));
result.unite(matrix * QVector3D(mincorner.x(), maxcorner.y(), mincorner.z()));
result.unite(matrix * QVector3D(maxcorner.x(), mincorner.y(), mincorner.z()));
result.unite(matrix * QVector3D(maxcorner.x(), maxcorner.y(), mincorner.z()));
result.unite(matrix * QVector3D(maxcorner.x(), mincorner.y(), maxcorner.z()));
result.unite(matrix * maxcorner);
return result;
}
/*!
\fn bool QBox3D::operator==(const QBox3D& box) const
Returns true if this box is identical to \a box.
*/
/*!
\fn bool QBox3D::operator!=(const QBox3D& box) const
Returns true if this box is not identical to \a box.
*/
/*!
\fn bool qFuzzyCompare(const QBox3D& box1, const QBox3D& box2)
\relates QBox3D
Returns true if \a box1 and \a box2 are almost equal; false otherwise.
*/
#ifndef QT_NO_DEBUG_STREAM
QDebug operator<<(QDebug dbg, const QBox3D &box)
{
if (box.isFinite()) {
dbg.nospace() << "QBox3D(("
<< box.minimum().x() << ", " << box.minimum().y() << ", "
<< box.minimum().z() << ") - ("
<< box.maximum().x() << ", " << box.maximum().y() << ", "
<< box.maximum().z() << "))";
return dbg.space();
} else if (box.isNull()) {
dbg << "QBox3D(null)";
return dbg;
} else {
dbg << "QBox3D(infinite)";
return dbg;
}
}
#endif
#ifndef QT_NO_DATASTREAM
/*!
\relates QBox3D
Writes the given \a box to the given \a stream and returns a
reference to the stream.
*/
QDataStream &operator<<(QDataStream &stream, const QBox3D &box)
{
if (box.isNull()) {
stream << int(0);
} else if (box.isInfinite()) {
stream << int(2);
} else {
stream << int(1);
stream << box.minimum();
stream << box.maximum();
}
return stream;
}
/*!
\relates QBox3D
Reads a 3D box from the given \a stream into the given \a box
and returns a reference to the stream.
*/
QDataStream &operator>>(QDataStream &stream, QBox3D &box)
{
int type;
stream >> type;
if (type == 1) {
QVector3D minimum, maximum;
stream >> minimum;
stream >> maximum;
box = QBox3D(minimum, maximum);
} else if (type == 2) {
box.setToInfinite();
} else {
box.setToNull();
}
return stream;
}
#endif // QT_NO_DATASTREAM
QT_END_NAMESPACE
|