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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkPropAssembly.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "vtkPropAssembly.h"
#include "vtkAssemblyNode.h"
#include "vtkAssemblyPath.h"
#include "vtkAssemblyPaths.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkProp.h"
#include "vtkPropCollection.h"
#include "vtkViewport.h"
vtkStandardNewMacro(vtkPropAssembly);
// Construct object with no children.
vtkPropAssembly::vtkPropAssembly()
{
this->Parts = vtkPropCollection::New();
vtkMath::UninitializeBounds(this->Bounds);
}
vtkPropAssembly::~vtkPropAssembly()
{
vtkCollectionSimpleIterator pit;
vtkProp *part;
for ( this->Parts->InitTraversal(pit);
(part=this->Parts->GetNextProp(pit)); )
{
part->RemoveConsumer(this);
}
this->Parts->Delete();
this->Parts = NULL;
}
// Add a part to the list of Parts.
void vtkPropAssembly::AddPart(vtkProp *prop)
{
if ( ! this->Parts->IsItemPresent(prop) )
{
this->Parts->AddItem(prop);
prop->AddConsumer(this);
this->Modified();
}
}
// Remove a part from the list of parts,
void vtkPropAssembly::RemovePart(vtkProp *prop)
{
if ( this->Parts->IsItemPresent(prop) )
{
prop->RemoveConsumer(this);
this->Parts->RemoveItem(prop);
this->Modified();
}
}
// Get the list of parts for this prop assembly.
vtkPropCollection *vtkPropAssembly::GetParts()
{
return this->Parts;
}
// Render this assembly and all of its Parts. The rendering process is recursive.
int vtkPropAssembly::RenderTranslucentPolygonalGeometry(vtkViewport *ren)
{
vtkProp *prop;
vtkAssemblyPath *path;
double fraction;
int renderedSomething=0;
// Make sure the paths are up-to-date
this->UpdatePaths();
double numberOfItems = static_cast<double>(this->Parts->GetNumberOfItems());
fraction = numberOfItems >= 1.0 ?
this->AllocatedRenderTime / numberOfItems : this->AllocatedRenderTime;
// render the Paths
vtkCollectionSimpleIterator sit;
for ( this->Paths->InitTraversal(sit); (path = this->Paths->GetNextPath(sit)); )
{
prop = path->GetLastNode()->GetViewProp();
if ( prop->GetVisibility() )
{
prop->SetAllocatedRenderTime(fraction, ren);
prop->PokeMatrix(path->GetLastNode()->GetMatrix());
renderedSomething += prop->RenderTranslucentPolygonalGeometry(ren);
prop->PokeMatrix(NULL);
}
}
return renderedSomething;
}
// Description:
// Does this prop have some translucent polygonal geometry?
int vtkPropAssembly::HasTranslucentPolygonalGeometry()
{
vtkProp *prop;
vtkAssemblyPath *path;
int result=0;
// Make sure the paths are up-to-date
this->UpdatePaths();
// render the Paths
vtkCollectionSimpleIterator sit;
for ( this->Paths->InitTraversal(sit); !result && (path = this->Paths->GetNextPath(sit)); )
{
prop = path->GetLastNode()->GetViewProp();
if ( prop->GetVisibility() )
{
result=prop->HasTranslucentPolygonalGeometry();
}
}
return result;
}
// Render this assembly and all of its Parts. The rendering process is recursive.
int vtkPropAssembly::RenderVolumetricGeometry(vtkViewport *ren)
{
vtkProp *prop;
vtkAssemblyPath *path;
double fraction;
int renderedSomething=0;
// Make sure the paths are up-to-date
this->UpdatePaths();
double numberOfItems = static_cast<double>(this->Parts->GetNumberOfItems());
fraction = numberOfItems >= 1.0 ?
this->AllocatedRenderTime / numberOfItems : this->AllocatedRenderTime;
// render the Paths
vtkCollectionSimpleIterator sit;
for ( this->Paths->InitTraversal(sit); (path = this->Paths->GetNextPath(sit)); )
{
prop = path->GetLastNode()->GetViewProp();
if ( prop->GetVisibility() )
{
prop->SetAllocatedRenderTime(fraction, ren);
prop->PokeMatrix(path->GetLastNode()->GetMatrix());
renderedSomething += prop->RenderVolumetricGeometry(ren);
prop->PokeMatrix(NULL);
}
}
return renderedSomething;
}
// Render this assembly and all its parts. The rendering process is recursive.
int vtkPropAssembly::RenderOpaqueGeometry(vtkViewport *ren)
{
vtkProp *prop;
vtkAssemblyPath *path;
double fraction;
int renderedSomething=0;
double numberOfItems = 0.0;
// Make sure the paths are up-to-date
this->UpdatePaths();
numberOfItems = static_cast<double>(this->Parts->GetNumberOfItems());
fraction = numberOfItems >= 1.0 ?
this->AllocatedRenderTime / numberOfItems : this->AllocatedRenderTime;
// render the Paths
vtkCollectionSimpleIterator sit;
for ( this->Paths->InitTraversal(sit); (path = this->Paths->GetNextPath(sit)); )
{
prop = path->GetLastNode()->GetViewProp();
if ( prop->GetVisibility() )
{
prop->SetAllocatedRenderTime(fraction, ren);
prop->PokeMatrix(path->GetLastNode()->GetMatrix());
renderedSomething += prop->RenderOpaqueGeometry(ren);
prop->PokeMatrix(NULL);
}
}
return renderedSomething;
}
// Render this assembly and all its parts. The rendering process is recursive.
int vtkPropAssembly::RenderOverlay(vtkViewport *ren)
{
vtkProp *prop;
vtkAssemblyPath *path;
double fraction;
int renderedSomething=0;
double numberOfItems = 0.0;
// Make sure the paths are up-to-date
this->UpdatePaths();
numberOfItems = static_cast<double>(this->Parts->GetNumberOfItems());
fraction = numberOfItems >= 1.0 ?
this->AllocatedRenderTime / numberOfItems : this->AllocatedRenderTime;
vtkCollectionSimpleIterator sit;
for ( this->Paths->InitTraversal(sit); (path = this->Paths->GetNextPath(sit)); )
{
prop = path->GetLastNode()->GetViewProp();
if ( prop->GetVisibility() )
{
prop->SetAllocatedRenderTime(fraction, ren);
prop->PokeMatrix(path->GetLastNode()->GetMatrix());
renderedSomething += prop->RenderOverlay(ren);
prop->PokeMatrix(NULL);
}
}
return renderedSomething;
}
void vtkPropAssembly::ReleaseGraphicsResources(vtkWindow *renWin)
{
vtkProp *part;
vtkProp::ReleaseGraphicsResources(renWin);
// broadcast the message down the Parts
vtkCollectionSimpleIterator pit;
for ( this->Parts->InitTraversal(pit);
(part=this->Parts->GetNextProp(pit)); )
{
part->ReleaseGraphicsResources(renWin);
}
}
// Get the bounds for the assembly as (Xmin,Xmax,Ymin,Ymax,Zmin,Zmax).
double *vtkPropAssembly::GetBounds()
{
vtkProp *part;
int i, n;
double *bounds, bbox[24];
int partVisible=0;
// carefully compute the bounds
vtkCollectionSimpleIterator pit;
for ( this->Parts->InitTraversal(pit);
(part=this->Parts->GetNextProp(pit)); )
{
if ( part->GetVisibility() && part->GetUseBounds() )
{
bounds = part->GetBounds();
if ( bounds != NULL )
{
// For the purposes of GetBounds, an object is visisble only if
// its visibility is on and it has visible parts.
if (!partVisible)
{
// initialize the bounds
this->Bounds[0] =this->Bounds[2] =this->Bounds[4] = VTK_DOUBLE_MAX;
this->Bounds[1] =this->Bounds[3] =this->Bounds[5] = -VTK_DOUBLE_MAX;
partVisible = 1;
}
// fill out vertices of a bounding box
bbox[ 0] = bounds[1]; bbox[ 1] = bounds[3]; bbox[ 2] = bounds[5];
bbox[ 3] = bounds[1]; bbox[ 4] = bounds[2]; bbox[ 5] = bounds[5];
bbox[ 6] = bounds[0]; bbox[ 7] = bounds[2]; bbox[ 8] = bounds[5];
bbox[ 9] = bounds[0]; bbox[10] = bounds[3]; bbox[11] = bounds[5];
bbox[12] = bounds[1]; bbox[13] = bounds[3]; bbox[14] = bounds[4];
bbox[15] = bounds[1]; bbox[16] = bounds[2]; bbox[17] = bounds[4];
bbox[18] = bounds[0]; bbox[19] = bounds[2]; bbox[20] = bounds[4];
bbox[21] = bounds[0]; bbox[22] = bounds[3]; bbox[23] = bounds[4];
for (i = 0; i < 8; i++)
{
for (n = 0; n < 3; n++)
{
if (bbox[i*3+n] < this->Bounds[n*2])
{
this->Bounds[n*2] = bbox[i*3+n];
}
if (bbox[i*3+n] > this->Bounds[n*2+1])
{
this->Bounds[n*2+1] = bbox[i*3+n];
}
}
}//for each point of box
}//if bounds
}//for each part
}//for each part
if ( ! partVisible )
{
return NULL;
}
else
{
return this->Bounds;
}
}
unsigned long int vtkPropAssembly::GetMTime()
{
unsigned long mTime=this->vtkProp::GetMTime();
unsigned long time;
vtkProp *part;
vtkCollectionSimpleIterator pit;
for (this->Parts->InitTraversal(pit);
(part=this->Parts->GetNextProp(pit)); )
{
time = part->GetMTime();
mTime = ( time > mTime ? time : mTime );
}
return mTime;
}
// Shallow copy another vtkPropAssembly.
void vtkPropAssembly::ShallowCopy(vtkProp *prop)
{
vtkPropAssembly *propAssembly = vtkPropAssembly::SafeDownCast(prop);
if ( propAssembly != NULL && propAssembly != this )
{
vtkCollectionSimpleIterator pit;
vtkProp *part;
for ( this->Parts->InitTraversal(pit);
(part=this->Parts->GetNextProp(pit)); )
{
part->RemoveConsumer(this);
}
this->Parts->RemoveAllItems();
for ( propAssembly->Parts->InitTraversal(pit);
(part=propAssembly->Parts->GetNextProp(pit)); )
{
this->AddPart(part);
}
}
this->vtkProp::ShallowCopy(prop);
}
void vtkPropAssembly::InitPathTraversal()
{
this->UpdatePaths();
this->Paths->InitTraversal();
}
vtkAssemblyPath *vtkPropAssembly::GetNextPath()
{
if ( this->Paths )
{
return this->Paths->GetNextItem();
}
return NULL;
}
int vtkPropAssembly::GetNumberOfPaths()
{
this->UpdatePaths();
return this->Paths->GetNumberOfItems();
}
// Build the assembly paths if necessary.
void vtkPropAssembly::UpdatePaths()
{
if ( this->GetMTime() > this->PathTime )
{
if ( this->Paths != NULL )
{
this->Paths->Delete();
this->Paths = NULL;
}
// Create the list to hold all the paths
this->Paths = vtkAssemblyPaths::New();
vtkAssemblyPath *path = vtkAssemblyPath::New();
//add ourselves to the path to start things off
path->AddNode(this,NULL);
vtkProp *prop;
// Add nodes as we proceed down the hierarchy
vtkCollectionSimpleIterator pit;
for ( this->Parts->InitTraversal(pit);
(prop = this->Parts->GetNextProp(pit)); )
{
// add a matrix, if any
path->AddNode(prop,prop->GetMatrix());
// dive into the hierarchy
prop->BuildPaths(this->Paths,path);
// when returned, pop the last node off of the
// current path
path->DeleteLastNode();
}
path->Delete();
this->PathTime.Modified();
}
}
void vtkPropAssembly::BuildPaths(vtkAssemblyPaths *paths,
vtkAssemblyPath *path)
{
vtkProp *prop;
vtkCollectionSimpleIterator pit;
for ( this->Parts->InitTraversal(pit);
(prop = this->Parts->GetNextProp(pit)); )
{
path->AddNode(prop,NULL);
// dive into the hierarchy
prop->BuildPaths(paths,path);
// when returned, pop the last node off of the
// current path
path->DeleteLastNode();
}
}
void vtkPropAssembly::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "There are: " << this->Parts->GetNumberOfItems()
<< " parts in this assembly\n";
}
|