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
|
/**************************************************************************\
*
* This file is part of the Coin 3D visualization library.
* Copyright (C) by Kongsberg Oil & Gas Technologies.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* ("GPL") version 2 as published by the Free Software Foundation.
* See the file LICENSE.GPL at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using Coin with software that can not be combined with the GNU
* GPL, and for taking advantage of the additional benefits of our
* support services, please contact Kongsberg Oil & Gas Technologies
* about acquiring a Coin Professional Edition License.
*
* See http://www.coin3d.org/ for more information.
*
* Kongsberg Oil & Gas Technologies, Bygdoy Alle 5, 0257 Oslo, NORWAY.
* http://www.sim.no/ sales@sim.no coin-support@coin3d.org
*
\**************************************************************************/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif // HAVE_CONFIG_H
#ifdef HAVE_VRML97
/*!
\class SoVRMLLOD SoVRMLLOD.h Inventor/VRMLnodes/SoVRMLLOD.h
\brief The SoVRMLLOD class is used to represent various levels of detail based on distance.
\ingroup VRMLnodes
\WEB3DCOPYRIGHT
\verbatim
LOD {
exposedField MFNode level []
field SFVec3f center 0 0 0 # (-,)
field MFFloat range [] # (0,)
}
\endverbatim
The LOD node specifies various levels of detail or complexity for a
given object, and provides hints allowing browsers to automatically
choose the appropriate version of the object based on the distance
from the user. The level field contains a list of nodes that
represent the same object or objects at varying levels of detail,
ordered from highest level of detail to the lowest level of
detail. The range field specifies the ideal distances at which to
switch between the levels. Subclause 4.6.5, Grouping and children
nodes
(<http://www.web3d.org/x3d/specifications/vrml/ISO-IEC-14772-VRML97/part1/concepts.html#4.6.5>),
contains details on the types of nodes that are legal values
for level.
The center field is a translation offset in the local coordinate
system that specifies the centre of the LOD node for distance
calculations.
The number of nodes in the level field shall exceed the number of
values in the range field by one (i.e., N+1 level values for N range
values). The range field contains monotonic increasing values that
shall be greater than zero. In order to calculate which level to
display, first the distance is calculated from the viewer's
location, transformed into the local coordinate system of the LOD
node (including any scaling transformations), to the center point of
the LOD node. Then, the LOD node evaluates the step function L(d)
to choose a level for a given value of d (where d is the distance
from the viewer position to the centre of the LOD node). Let n
ranges, R0, R1, R2, ..., Rn-1, partition the domain (0, +infinity)
into n+1 subintervals given by (0, R0), [R0, R1)... , [Rn-1,
+infinity). Also, let n levels L0, L1, L2, ..., Ln-1 be the values
of the step function function L(d). The level node, L(d), for a
given distance d is defined as follows:
\verbatim
L(d) = L0, if d < R0,
= Li+1, if Ri <= d < Ri+1, for -1 < i < n-1,
= Ln-1, if d >= Rn-1.
\endverbatim
Specifying too few levels will result in the last level being used
repeatedly for the lowest levels of detail. If more levels than
ranges are specified, the extra levels are ignored. An empty range
field is an exception to this rule. This case is a hint to the
browser that it may choose a level automatically to maintain a
constant display rate. Each value in the range field shall be
greater than the previous value.
LOD nodes are evaluated top-down in the scene graph. Only the
descendants of the currently selected level are rendered. All nodes
under an LOD node continue to receive and send events regardless of
which LOD node's level is active. For example, if an active
TimeSensor node is contained within an inactive level of an LOD
node, the TimeSensor node sends events regardless of the LOD node's
state.
*/
/*!
\var SoMFFloat SoVRMLLOD::range
The range for each level.
*/
/*!
\var SoSFVec3f SoVRMLLOD::center
The center used when calculating distance.
*/
/*!
\var SoMFNode SoVRMLLOD::level
The different levels.
*/
#include <Inventor/VRMLnodes/SoVRMLLOD.h>
#include <Inventor/VRMLnodes/SoVRMLMacros.h>
#include <Inventor/VRMLnodes/SoVRMLParent.h>
#include <Inventor/actions/SoGLRenderAction.h>
#include <Inventor/actions/SoWriteAction.h>
#include <Inventor/elements/SoCacheElement.h>
#include <Inventor/elements/SoGLCacheContextElement.h>
#include <Inventor/elements/SoModelMatrixElement.h>
#include <Inventor/elements/SoViewVolumeElement.h>
#include <Inventor/misc/SoChildList.h>
#include <Inventor/misc/SoState.h>
#include <Inventor/SbMatrix.h>
#include <Inventor/errors/SoDebugError.h>
#include <Inventor/system/gl.h>
#include "glue/glp.h"
#include "misc/SoGL.h"
#include "nodes/SoSubNodeP.h"
#include "nodes/SoSoundElementHelper.h"
#include "profiler/SoNodeProfiling.h"
// *************************************************************************
class SoVRMLLODP : public SoSoundElementHelper
{
public:
SbBool childlistvalid;
};
#define PRIVATE(obj) ((obj)->pimpl)
// *************************************************************************
SO_NODE_SOURCE(SoVRMLLOD);
// *************************************************************************
// Doc in parent
void
SoVRMLLOD::initClass(void) // static
{
SO_NODE_INTERNAL_INIT_CLASS(SoVRMLLOD, SO_VRML97_NODE_TYPE);
}
/*!
Constructor.
*/
SoVRMLLOD::SoVRMLLOD(void)
{
this->commonConstructor();
}
/*!
Destructor.
*/
SoVRMLLOD::~SoVRMLLOD() // virtual, protected
{
delete PRIVATE(this);
}
/*!
Constructor. \a levels is the expected number of levels.
*/
SoVRMLLOD::SoVRMLLOD(int levels)
: SoGroup(levels)
{
this->commonConstructor();
}
void
SoVRMLLOD::commonConstructor(void)
{
PRIVATE(this) = new SoVRMLLODP;
PRIVATE(this)->childlistvalid = FALSE;
SO_VRMLNODE_INTERNAL_CONSTRUCTOR(SoVRMLLOD);
SO_VRMLNODE_ADD_FIELD(center, (0.0f, 0.0f, 0.0f));
SO_VRMLNODE_ADD_EMPTY_MFIELD(range);
SO_VRMLNODE_ADD_EMPTY_EXPOSED_MFIELD(level);
// HACK WARNING: All children of this node are stored in the level
// field. Avoid double notifications (because of notification
// through SoChildList) be reallocating the SoChildList with a
// NULL-parent here. SoGroup will have allocated an SoChildList in
// its constructor when we get here.
delete this->SoGroup::children;
this->SoGroup::children = new SoChildList(NULL);
}
// *************************************************************************
// Doc in parent
SbBool
SoVRMLLOD::affectsState(void) const // virtual
{
return FALSE;
}
/*!
Adds a new level.
*/
void
SoVRMLLOD::addLevel(SoNode * levelptr)
{
this->addChild(levelptr);
}
/*!
Inserts a new level.
*/
void
SoVRMLLOD::insertLevel(SoNode * levelptr,
int idx)
{
this->insertChild(levelptr, idx);
}
/*!
Returns a level.
*/
SoNode *
SoVRMLLOD::getLevel(int idx) const
{
return this->getChild(idx);
}
/*!
Find \a node, and return the level index or -1 if not found.
*/
int
SoVRMLLOD::findLevel(const SoNode * node) const
{
return this->findChild(node);
}
/*!
Return the number of levels.
*/
int
SoVRMLLOD::getNumLevels(void) const
{
return this->level.getNum();
}
/*!
Removes the level at index \a idx.
*/
void
SoVRMLLOD::removeLevel(int idx)
{
this->removeChild(idx);
}
/*!
Find \a level, and remove it if found.
*/
void
SoVRMLLOD::removeLevel(SoNode * levelptr)
{
this->removeChild(levelptr);
}
/*!
Remove all levels.
*/
void
SoVRMLLOD::removeAllLevels(void)
{
this->removeAllChildren();
}
/*!
Replace the level at \a idx with \a node.
*/
void
SoVRMLLOD::replaceLevel(int idx,
SoNode * node)
{
this->replaceChild(idx, node);
}
/*!
Find \a oldnode, and replace it with \a newnode.
*/
void
SoVRMLLOD::replaceLevel(SoNode * oldnode,
SoNode * newnode)
{
this->replaceChild(oldnode, newnode);
}
// Doc in parent
void
SoVRMLLOD::doAction(SoAction * action)
{
int numindices;
const int * indices;
SoAction::PathCode pathcode = action->getPathCode(numindices, indices);
if (pathcode == SoAction::IN_PATH) {
this->getChildren()->traverseInPath(action, numindices, indices);
}
else {
int idx = this->whichToTraverse(action);;
if (idx >= 0) {
this->getChildren()->traverse(action, idx);
PRIVATE(this)->enableTraversingOfInactiveChildren();
PRIVATE(this)->traverseInactiveChildren(this, action, idx, pathcode,
this->getNumChildren(),
this->getChildren());
}
}
}
// Doc in parent
void
SoVRMLLOD::callback(SoCallbackAction * action)
{
SoVRMLLOD::doAction((SoAction*)action);
}
// Doc in parent
void
SoVRMLLOD::GLRender(SoGLRenderAction * action)
{
switch (action->getCurPathCode()) {
case SoAction::NO_PATH:
case SoAction::BELOW_PATH:
SoVRMLLOD::GLRenderBelowPath(action);
break;
case SoAction::IN_PATH:
SoVRMLLOD::GLRenderInPath(action);
break;
case SoAction::OFF_PATH:
SoVRMLLOD::GLRenderOffPath(action);
break;
default:
assert(0 && "unknown path code.");
break;
}
}
// Doc in parent
void
SoVRMLLOD::rayPick(SoRayPickAction * action)
{
SoVRMLLOD::doAction((SoAction*) action);
}
// Doc in parent
void
SoVRMLLOD::getBoundingBox(SoGetBoundingBoxAction * action)
{
// FIXME: SGI OIV seems to do some extra work here, but the manual
// pages states that it should do a normal SoGroup traversal.
// we should _not_ use whichToTraverse() to calculate bbox as
// this would cause cache dependencies on the camera and
// the model matrix. pederb, 2001-02-21
inherited::getBoundingBox(action);
}
// Doc in parent
void
SoVRMLLOD::search(SoSearchAction * action)
{
inherited::search(action);
}
// Doc in parent
void
SoVRMLLOD::write(SoWriteAction * action)
{
SoNode::write(action);
}
// Doc in parent
void
SoVRMLLOD::getPrimitiveCount(SoGetPrimitiveCountAction * action)
{
SoVRMLLOD::doAction((SoAction*) action);
}
// Doc in parent
void
SoVRMLLOD::audioRender(SoAudioRenderAction * action)
{
PRIVATE(this)->preAudioRender(this, action);
SoVRMLLOD::doAction((SoAction*) action);
PRIVATE(this)->postAudioRender(this, action);
}
// Doc in parent
void
SoVRMLLOD::GLRenderBelowPath(SoGLRenderAction * action)
{
int idx = this->whichToTraverse(action);
if (idx >= 0) {
SoNode * child = (SoNode*) this->getChildren()->get(idx);
action->pushCurPath(idx, child);
if (!action->abortNow()) {
SoNodeProfiling profiling;
profiling.preTraversal(action);
child->GLRenderBelowPath(action);
profiling.postTraversal(action);
#if COIN_DEBUG
// The GL error test is default disabled for this optimized
// path. If you get a GL error reporting an error in the
// Separator node, enable this code by setting the environment
// variable COIN_GLERROR_DEBUGGING to "1" to see exactly which
// node caused the error.
static SbBool chkglerr = sogl_glerror_debugging();
if (chkglerr) {
cc_string str;
cc_string_construct(&str);
const unsigned int errs = coin_catch_gl_errors(&str);
if (errs > 0) {
SoDebugError::post("SoVRMLLOD::GLRenderBelowPath",
"glGetError()s => '%s', nodetype: '%s'",
cc_string_get_text(&str),
(*this->getChildren())[idx]->getTypeId().getName().getString());
}
cc_string_clean(&str);
}
#endif // COIN_DEBUG
}
action->popCurPath();
}
// don't auto cache LOD nodes.
SoGLCacheContextElement::shouldAutoCache(action->getState(),
SoGLCacheContextElement::DONT_AUTO_CACHE);
}
// Doc in parent
void
SoVRMLLOD::GLRenderInPath(SoGLRenderAction * action)
{
int numindices;
const int * indices;
SoAction::PathCode pathcode = action->getPathCode(numindices, indices);
if (pathcode == SoAction::IN_PATH) {
for (int i = 0; (i < numindices) && !action->hasTerminated(); i++) {
int idx = indices[i];
SoNode * child = this->getChild(idx);
action->pushCurPath(idx, child);
if (!action->abortNow()) {
SoNodeProfiling profiling;
profiling.preTraversal(action);
child->GLRenderInPath(action);
profiling.postTraversal(action);
}
action->popCurPath(pathcode);
}
}
else {
assert(pathcode == SoAction::BELOW_PATH);
SoVRMLLOD::GLRenderBelowPath(action);
}
}
// Doc in parent
void
SoVRMLLOD::GLRenderOffPath(SoGLRenderAction * action)
{
int idx = this->whichToTraverse(action);;
if (idx >= 0) {
SoNode * child = this->getChild(idx);
if (child->affectsState()) {
action->pushCurPath(idx, child);
if (!action->abortNow()) {
SoNodeProfiling profiling;
profiling.preTraversal(action);
child->GLRenderOffPath(action);
profiling.postTraversal(action);
}
action->popCurPath();
}
}
}
// Doc in parent
void
SoVRMLLOD::addChild(SoNode * child)
{
this->level.addNode(child);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
void
SoVRMLLOD::insertChild(SoNode * child, int idx)
{
this->level.insertNode(child, idx);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
SoNode *
SoVRMLLOD::getChild(int idx) const
{
return this->level.getNode(idx);
}
// Doc in parent
int
SoVRMLLOD::findChild(const SoNode * child) const
{
return this->level.findNode(child);
}
// Doc in parent
int
SoVRMLLOD::getNumChildren(void) const // virtual
{
return this->level.getNumNodes();
}
// Doc in parent
void
SoVRMLLOD::removeChild(int idx)
{
this->level.removeNode(idx);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
void
SoVRMLLOD::removeChild(SoNode * child)
{
this->level.removeNode(child);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
void
SoVRMLLOD::removeAllChildren(void)
{
this->level.removeAllNodes();
SoGroup::children->truncate(0);
PRIVATE(this)->childlistvalid = TRUE;
}
// Doc in parent
void
SoVRMLLOD::replaceChild(int idx, SoNode * child)
{
this->level.replaceNode(idx, child);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
void
SoVRMLLOD::replaceChild(SoNode * old,
SoNode * child)
{
this->level.replaceNode(old, child);
PRIVATE(this)->childlistvalid = FALSE;
}
// Doc in parent
void
SoVRMLLOD::notify(SoNotList * list)
{
SoField * f = list->getLastField();
if (f == &this->level) {
PRIVATE(this)->childlistvalid = FALSE;
}
inherited::notify(list);
PRIVATE(this)->notifyCalled();
}
// Doc in parent
SbBool
SoVRMLLOD::readInstance(SoInput * in,
unsigned short flags)
{
SoGroup::children->truncate(0);
SbBool oldnot = this->level.enableNotify(FALSE);
SbBool ret = inherited::readInstance(in, flags);
if (oldnot) this->level.enableNotify(TRUE);
PRIVATE(this)->childlistvalid = FALSE;
return ret;
}
// Doc in parent
void
SoVRMLLOD::copyContents(const SoFieldContainer * from,
SbBool copyConn)
{
SoGroup::children->truncate(0);
SoNode::copyContents(from, copyConn);
PRIVATE(this)->childlistvalid = FALSE;
}
/*!
Returns the child to traverse based on distance to current viewpoint.
*/
int
SoVRMLLOD::whichToTraverse(SoAction * action)
{
// FIXME: according to the spec, if range is empty, we should decide
// a level to try to maintain a constant/high frame rate...
// pederb, 2002-06-10
SoState * state = action->getState();
const SbMatrix & mat = SoModelMatrixElement::get(state);
const SbViewVolume & vv = SoViewVolumeElement::get(state);
SbVec3f worldcenter;
mat.multVecMatrix(this->center.getValue(), worldcenter);
float dist = (vv.getProjectionPoint() - worldcenter).length();
int i;
int n = this->range.getNum();
for (i = 0; i < n; i++) {
if (dist < this->range[i]) break;
}
if (i >= this->getNumChildren()) i = this->getNumChildren() - 1;
return i;
}
// Doc in parent
SoChildList *
SoVRMLLOD::getChildren(void) const
{
if (!PRIVATE(this)->childlistvalid) {
SoVRMLParent::updateChildList(this->level.getValues(0),
this->level.getNum(),
*SoGroup::children);
((SoVRMLLOD*)this)->pimpl->childlistvalid = TRUE;
}
return SoGroup::children;
}
#undef PRIVATE
#endif // HAVE_VRML97
|