I think in essence that is what Regrid should do, but I don't believe
it does. If you run Regrid with those parameters it still does an
O(n!) algorithm and can take hours, where as Jeff's version can take
seconds.
David
Then I agree with Dave - this seems like a special case of Regrid, where
the grid is fully regular, nearest is 1 and radius is 0. I guess you are
inverting the 4x4 |d00 d01 d02 0| and applying the inverse to the scattered
(xyz) coordinate to get the (ijk) coordinate?
|d10 d11 d12 0|
|d20 d21 d22 0|
| ox oy oz 1|
I *hope* thats what Regrid does when the grid is regular, but then it
doesn't assume that the resulting (ijk) coordinate will hit the grid vertex
(or at least will with a little rounding).
Couldn't you get the cdep case in a macro in which you create a new grid
with 1 less point in each dimension and a new origin (orig. origin) + (0.5
0.5 0.5)(deltas), run Regrid as above, pull the resulting pdep data
component off the result, change the dependency attribute to "connections"
and Replace it onto the original grid?
This is exactly the sort of discussion we had in the modules committee
meetings.
Greg
Jeff Braun <[EMAIL PROTECTED]>@opendx.watson.ibm.com on 01/10/2001 01:46:07
PM
Please respond to [email protected]
Sent by: [EMAIL PROTECTED]
To: [email protected]
cc:
Subject: Re: [opendx-dev] Adding a new module to CVS?
--
.............................................................................
David L. Thompson The University of Montana
mailto:[EMAIL PROTECTED] Computer Science Department
http://www.cs.umt.edu/u/dthompsn Missoula, MT 59812
Work Phone : (406)257-8530
