| 310 | } |
| 311 | |
| 312 | void mitk::SlicedData::SetOrigin(const mitk::Point3D &origin) |
| 313 | { |
| 314 | TimeGeometry *timeGeometry = GetTimeGeometry(); |
| 315 | |
| 316 | assert(timeGeometry != nullptr); |
| 317 | |
| 318 | mitk::SlicedGeometry3D *slicedGeometry; |
| 319 | |
| 320 | unsigned int steps = timeGeometry->CountTimeSteps(); |
| 321 | |
| 322 | for (unsigned int timestep = 0; timestep < steps; ++timestep) |
| 323 | { |
| 324 | slicedGeometry = GetSlicedGeometry(timestep); |
| 325 | if (slicedGeometry != nullptr) |
| 326 | { |
| 327 | slicedGeometry->SetOrigin(origin); |
| 328 | if (slicedGeometry->GetEvenlySpaced()) |
| 329 | { |
| 330 | mitk::PlaneGeometry *geometry2D = slicedGeometry->GetPlaneGeometry(0); |
| 331 | geometry2D->SetOrigin(origin); |
| 332 | slicedGeometry->InitializeEvenlySpaced(geometry2D, slicedGeometry->GetSlices()); |
| 333 | } |
| 334 | } |
| 335 | // ProportionalTimeGeometry* timeGeometry = dynamic_cast<ProportionalTimeGeometry *>(GetTimeGeometry()); |
| 336 | // if(timeGeometry != nullptr) |
| 337 | //{ |
| 338 | // timeGeometry->Initialize(slicedGeometry, steps); |
| 339 | // break; |
| 340 | //} |
| 341 | } |
| 342 | } |
| 343 | |
| 344 | void mitk::SlicedData::SetSpacing(mitk::Vector3D aSpacing) |
| 345 | { |
nothing calls this directly
no test coverage detected