1. 02 Dec, 2011 6 commits
  2. 01 Dec, 2011 1 commit
  3. 30 Nov, 2011 2 commits
    • Bob Obara's avatar
      ENH: Improved Resample Filter Speed · dae0a92a
      Bob Obara authored
      If a previous grid does not contain the current point then the
      level containing the grid is tested.  If the level does contain the
      point the newly found grid is used that and the next level is tested
      Else the level is reset to 0 and the max level is set to 1 below
      the previous level.
      Also added a trivial bounds test.
      Also fixed a bug that caused the resulting uniform grid to be
      larger than the requested resolution.
      Change-Id: I83656837ae2cf0e63d96a3f00d4db06ecc6ff3e7
    • Bob Obara's avatar
      ENH: Tightened the bounds of the View Frustrum · 933fd2f1
      Bob Obara authored
      The previous version mapped the entire view frustrum into
      world coordinates which resulted in an uniform grid that had much
      larger bounds than needed.  Now the depth of the frustrum is limited
      to the bounds of the AMR Data.
      Change-Id: Ia1cc9b3d44a6c58cae83a2bc7f7d2303415c9bd1
  4. 22 Nov, 2011 1 commit
  5. 14 Nov, 2011 3 commits
    • George Zagaris's avatar
      ENH: Faster probing algorithm & modularization · b9dbcdad
      George Zagaris authored
      This commit introduces a new probing algorithm for transfering the
      solution to the requested re-sampled grid. The main features of the
      algorithm are as follows:
      (1) Use a previously found grid and its level as a starting point for the search otherwise,
      start from level 0.
      (2) Break from the main search loop as soon as possible. If a grid that satisfies the
      query is found at level k, but not in level k+1, use the solution at level k and exit.
      Note, this condition guarantees that at any level > k+1 we are not going to find a grid
      that satisfies the given query.
    • George Zagaris's avatar
      STYLE: Conform to VTK's standards · e6d5e006
      George Zagaris authored
      Changed code stly to conform to VTK's standards.
    • George Zagaris's avatar
      WIP:Improve the performance of resampling · de351f01
      George Zagaris authored
      Changed algorithm to cache and check the previously found
      grid that contained the query point on the uniform grid for
      the next point.
  6. 11 Nov, 2011 7 commits
  7. 10 Nov, 2011 2 commits
    • George Zagaris's avatar
      BUGFIX: Correct initialization · fba2b24a
      George Zagaris authored
      Added code that will cause the ComputeAndAdjustRegionParameters to
      return an empty dataset when it is first called. ComputeAndAdjustParameters
      is first called in GetInformation (if we are in demand-driven mode).
      At this point, the user has not requested a region and hence N becomes 2.
      In order, to get the correct value of N and proper behavior, the user had to
      change the number of samples in the GUI, e.g., say to 5 and then change it
      back to 10. Thereafter the filter would work as expected. This commit will
      cause the filter to essentially ignore the first time it is being called.
    • George Zagaris's avatar
      ENH: Dynamic adjustment of N · 212c0bb9
      George Zagaris authored
      This commit introduces code to dynamically adjust N after the
      region is snapped to fit inside the domain as well as handling
      of cases where the requested region is outside the domain. When
      the requested region is outside the domain, an empty multiblock
      dataset is returned as output.
  8. 09 Nov, 2011 1 commit
  9. 08 Nov, 2011 4 commits
  10. 07 Nov, 2011 1 commit
    • George Zagaris's avatar
      WIP: Snapping & API changes · e18b4844
      George Zagaris authored
      API changes to allow resample filter to accept a number of requested
      samples instead of an AMR level. Further, semi-working snapping functionality
      was added.
  11. 03 Nov, 2011 1 commit
  12. 01 Nov, 2011 4 commits
  13. 31 Oct, 2011 1 commit
    • George Zagaris's avatar
      ENH: Arbitrary RCB Partitioning · f7181047
      George Zagaris authored
      Changed paritioner s.t. it is not restricted to producing
      2^k partitions. It uses a vtkPriorityQueue to store extents
      and always subdivides the largest partition along the longest
  14. 26 Oct, 2011 1 commit
  15. 24 Oct, 2011 2 commits
  16. 21 Oct, 2011 1 commit
  17. 18 Oct, 2011 2 commits