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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkExtentSplitter.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 "vtkExtentSplitter.h"
#include "vtkObjectFactory.h"
#include <vtkstd/map>
#include <vtkstd/queue>
#include <vtkstd/vector>
vtkStandardNewMacro(vtkExtentSplitter);
//----------------------------------------------------------------------------
struct vtkExtentSplitterExtent
{
int extent[6];
};
struct vtkExtentSplitterSource
{
int extent[6];
int priority;
};
struct vtkExtentSplitterSubExtent
{
int extent[6];
int source;
};
class vtkExtentSplitterInternals
{
public:
typedef vtkstd::queue<vtkExtentSplitterExtent> QueueType;
typedef vtkstd::map<int, vtkExtentSplitterSource> SourcesType;
typedef vtkstd::vector<vtkExtentSplitterSubExtent> SubExtentsType;
SourcesType Sources;
QueueType Queue;
SubExtentsType SubExtents;
};
//----------------------------------------------------------------------------
vtkExtentSplitter::vtkExtentSplitter()
{
this->Internal = new vtkExtentSplitterInternals;
this->PointMode = 0;
}
//----------------------------------------------------------------------------
vtkExtentSplitter::~vtkExtentSplitter()
{
delete this->Internal;
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
vtkIndent nextIndent = indent.GetNextIndent();
os << indent << "PointMode: " << this->PointMode << "\n";
if(this->Internal->Sources.empty())
{
os << indent << "Extent Sources: (none)\n";
}
else
{
os << indent << "Extent Sources: (format = \"id priority: extent\")\n";
for(vtkExtentSplitterInternals::SourcesType::const_iterator src =
this->Internal->Sources.begin();
src != this->Internal->Sources.end(); ++src)
{
const int* extent = src->second.extent;
os << nextIndent << src->first
<< " " << src->second.priority << ": "
<< extent[0] << " " << extent[1] << " "
<< extent[2] << " " << extent[3] << " "
<< extent[4] << " " << extent[5] << "\n";
}
}
os << indent << "Number of Extents in Queue: " <<
static_cast<int>(this->Internal->Queue.size()) << "\n";
if(this->Internal->SubExtents.empty())
{
os << indent << "SubExtents: (none)\n";
}
else
{
os << indent << "SubExtents: (format = \"id: extent\")\n";
for(vtkExtentSplitterInternals::SubExtentsType::const_iterator i =
this->Internal->SubExtents.begin();
i != this->Internal->SubExtents.end(); ++i)
{
const int* extent = i->extent;
os << nextIndent << i->source << ": "
<< extent[0] << " " << extent[1] << " "
<< extent[2] << " " << extent[3] << " "
<< extent[4] << " " << extent[5] << "\n";
}
}
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::AddExtentSource(int id, int priority, int x0, int x1,
int y0, int y1, int z0, int z1)
{
// Add the source.
vtkExtentSplitterSource& source = this->Internal->Sources[id];
source.extent[0] = x0;
source.extent[1] = x1;
source.extent[2] = y0;
source.extent[3] = y1;
source.extent[4] = z0;
source.extent[5] = z1;
source.priority = priority;
// Previously calculated sub-extents are now invalid.
this->Internal->SubExtents.clear();
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::AddExtentSource(int id, int priority, int* extent)
{
this->AddExtentSource(id, priority, extent[0], extent[1], extent[2],
extent[3], extent[4], extent[5]);
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::RemoveExtentSource(int id)
{
// Remove the source.
this->Internal->Sources.erase(id);
// Previously calculated sub-extents are now invalid.
this->Internal->SubExtents.clear();
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::RemoveAllExtentSources()
{
// Clear the set of sources.
this->Internal->Sources.clear();
// Previously calculated sub-extents are now invalid.
this->Internal->SubExtents.clear();
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::AddExtent(int x0, int x1, int y0, int y1,
int z0, int z1)
{
// Queue the extent.
vtkExtentSplitterExtent e;
e.extent[0] = x0;
e.extent[1] = x1;
e.extent[2] = y0;
e.extent[3] = y1;
e.extent[4] = z0;
e.extent[5] = z1;
this->Internal->Queue.push(e);
// Previously calculated sub-extents are now invalid.
this->Internal->SubExtents.clear();
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::AddExtent(int* extent)
{
this->AddExtent(extent[0], extent[1], extent[2],
extent[3], extent[4], extent[5]);
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::GetNumberOfSubExtents()
{
return static_cast<int>(this->Internal->SubExtents.size());
}
//----------------------------------------------------------------------------
int* vtkExtentSplitter::GetSubExtent(int index)
{
if(index < 0 || index >= this->GetNumberOfSubExtents())
{
static int dummy[6] = {0, -1, 0, -1, 0, -1};
vtkErrorMacro("SubExtent index " << index << " is out of range [0,"
<< this->GetNumberOfSubExtents()-1 << "]");
return dummy;
}
return this->Internal->SubExtents[index].extent;
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::GetSubExtent(int index, int* extent)
{
if(index < 0 || index >= this->GetNumberOfSubExtents())
{
vtkErrorMacro("SubExtent index " << index << " is out of range [0,"
<< this->GetNumberOfSubExtents()-1 << "]");
extent[0] = 0;
extent[1] = -1;
extent[2] = 0;
extent[3] = -1;
extent[4] = 0;
extent[5] = -1;
}
else
{
int i;
int* e = this->Internal->SubExtents[index].extent;
for(i=0; i < 6; ++i)
{
extent[i] = e[i];
}
}
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::GetSubExtentSource(int index)
{
if(index < 0 || index >= this->GetNumberOfSubExtents())
{
vtkErrorMacro("SubExtent index " << index << " is out of range [0,"
<< this->GetNumberOfSubExtents()-1 << "]");
return -1;
}
return this->Internal->SubExtents[index].source;
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::ComputeSubExtents()
{
// Assume success.
int result = 1;
vtkExtentSplitterInternals::SubExtentsType subExtents;
int bestPriority;
int dimensionality = 0;
while(!this->Internal->Queue.empty())
{
// Pop the next extent off the queue.
vtkExtentSplitterExtent e = this->Internal->Queue.front();
this->Internal->Queue.pop();
// In non-PointMode, intersections must have the same topological
// dimension as the original extent. This will prevent
// high-priority source extents from repeatedly producing
// single-point-wide intersections.
if(!this->PointMode)
{
dimensionality = (((e.extent[1]-e.extent[0] > 0)?1:0)+
((e.extent[3]-e.extent[2] > 0)?1:0)+
((e.extent[5]-e.extent[4] > 0)?1:0));
}
// Intersect the extent with each extent source.
subExtents.clear();
bestPriority = -1;
vtkExtentSplitterSubExtent se;
for(vtkExtentSplitterInternals::SourcesType::const_iterator src =
this->Internal->Sources.begin();
src != this->Internal->Sources.end(); ++src)
{
se.source = src->first;
if(this->IntersectExtents(e.extent, src->second.extent, se.extent) &&
(this->PointMode ||
(dimensionality == (((se.extent[1]-se.extent[0] > 0)?1:0)+
((se.extent[3]-se.extent[2] > 0)?1:0)+
((se.extent[5]-se.extent[4] > 0)?1:0)))))
{
// Non-zero intersection volume. Add the extent as a
// candidate for best extent.
if(src->second.priority > bestPriority)
{
// New highest priority. Clear previous intersections with
// lower priority.
subExtents.clear();
subExtents.push_back(se);
bestPriority = src->second.priority;
}
else if(src->second.priority == bestPriority)
{
// Matching priority. Add this intersection to the list.
subExtents.push_back(se);
}
}
}
// Check whether any extent sources intersected the extent.
if(subExtents.empty())
{
// No extent source intersected the extent. Add the extent as
// an error.
int i;
result = 0;
se.source = -1;
for(i=0; i < 6; ++i)
{
se.extent[i] = e.extent[i];
}
this->Internal->SubExtents.push_back(se);
}
else
{
// Choose the extent intersection with the largest volume.
int bestVolume = 0;
int bestIndex = 0;
int i;
for(i=0; i < static_cast<int>(subExtents.size()); ++i)
{
int* extent = subExtents[i].extent;
int volume = ((extent[1]-extent[0]+1)*
(extent[3]-extent[2]+1)*
(extent[5]-extent[4]+1));
if(volume > bestVolume)
{
bestVolume = volume;
bestIndex = i;
}
}
// Add this extent source with its sub-extent.
se.source = subExtents[bestIndex].source;
for(i=0; i < 6; ++i)
{
se.extent[i] = subExtents[bestIndex].extent[i];
}
this->Internal->SubExtents.push_back(se);
// Subtract the sub-extent from the extent and split the rest of
// the volume into more sub-extents.
this->SplitExtent(e.extent, se.extent);
}
}
return result;
}
//----------------------------------------------------------------------------
void vtkExtentSplitter::SplitExtent(int* extent, int* subextent)
{
// Subtract the volume described by subextent from that described by
// extent. Split the remaining region into rectangular solids and
// queue them as additional extents. We may assume that subextent
// is completely contained by extent.
vtkExtentSplitterExtent e;
// In PointMode, there are no cell data, so we can skip over cells.
int pointMode = this->PointMode?1:0;
// Split with xy-planes.
if(extent[4] < subextent[4])
{
e.extent[0] = extent[0];
e.extent[1] = extent[1];
e.extent[2] = extent[2];
e.extent[3] = extent[3];
e.extent[4] = extent[4];
e.extent[5] = subextent[4]-pointMode;
this->Internal->Queue.push(e);
extent[4] = subextent[4];
}
if(extent[5] > subextent[5])
{
e.extent[0] = extent[0];
e.extent[1] = extent[1];
e.extent[2] = extent[2];
e.extent[3] = extent[3];
e.extent[4] = subextent[5]+pointMode;
e.extent[5] = extent[5];
this->Internal->Queue.push(e);
extent[5] = subextent[5];
}
// Split with xz-planes.
if(extent[2] < subextent[2])
{
e.extent[0] = extent[0];
e.extent[1] = extent[1];
e.extent[2] = extent[2];
e.extent[3] = subextent[2]-pointMode;
e.extent[4] = extent[4];
e.extent[5] = extent[5];
this->Internal->Queue.push(e);
extent[2] = subextent[2];
}
if(extent[3] > subextent[3])
{
e.extent[0] = extent[0];
e.extent[1] = extent[1];
e.extent[2] = subextent[3]+pointMode;
e.extent[3] = extent[3];
e.extent[4] = extent[4];
e.extent[5] = extent[5];
this->Internal->Queue.push(e);
extent[3] = subextent[3];
}
// Split with yz-planes.
if(extent[0] < subextent[0])
{
e.extent[0] = extent[0];
e.extent[1] = subextent[0]-pointMode;
e.extent[2] = extent[2];
e.extent[3] = extent[3];
e.extent[4] = extent[4];
e.extent[5] = extent[5];
this->Internal->Queue.push(e);
extent[0] = subextent[0];
}
if(extent[1] > subextent[1])
{
e.extent[0] = subextent[1]+pointMode;
e.extent[1] = extent[1];
e.extent[2] = extent[2];
e.extent[3] = extent[3];
e.extent[4] = extent[4];
e.extent[5] = extent[5];
this->Internal->Queue.push(e);
// Leave this line out because the value will not be used:
//extent[1] = subextent[1];
}
// At this point, we should have extent[i] == subextent[i] for 0 <= i < 6.
// No more volume remains.
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::IntersectExtents(const int* extent1, const int* extent2,
int* result)
{
if((extent1[0] > extent2[1]) || (extent1[2] > extent2[3]) ||
(extent1[4] > extent2[5]) || (extent1[1] < extent2[0]) ||
(extent1[3] < extent2[2]) || (extent1[5] < extent2[4]))
{
// No intersection of extents.
return 0;
}
// Get the intersection of the extents.
result[0] = this->Max(extent1[0], extent2[0]);
result[1] = this->Min(extent1[1], extent2[1]);
result[2] = this->Max(extent1[2], extent2[2]);
result[3] = this->Min(extent1[3], extent2[3]);
result[4] = this->Max(extent1[4], extent2[4]);
result[5] = this->Min(extent1[5], extent2[5]);
return 1;
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::Min(int a, int b)
{
return (a < b)? a : b;
}
//----------------------------------------------------------------------------
int vtkExtentSplitter::Max(int a, int b)
{
return (a > b)? a : b;
}
|