Hello, I have a computational grid which looks like the attached image. There is a minimum sized grid cell and all larger grid cells have a size equal to some integer * the smallest grid cell size. I'm currently imaging this in opendx by using an array of positions and (quad) connections. Unfortunately the algorithm I'm using to write this to file is INCREDIBLY slow.
Rather than writing an array of positions, can I use the origin 0 0 0 delta 0 1 0 delta 1 0 0 etc... to describe regular positions for the finest grid, and irregular quad connections? If so (and I hope the answer is yes) is the approach the same as irregular positions/irregular conections; i.e. are the connections still some offset into an array of positions? Thanks a lot for any help! Tom _________________________________________________________________________ Thomas Gardiner [EMAIL PROTECTED] University of Rochester Department of Physics and Astronomy P. O. Box 270171 Rochester, NY 14627-0171 (716) 275-8557 Office (716) 275-8527 fax __________________________________________________________________________ The scientist does not study nature because it is useful; he studies it because he delights in it, and he delights in it because it is beautiful. If nature were not beautiful, it would not be worth knowing, and if nature were not worth knowing, life would not be worth living.- Henri Poincare __________________________________________________________________________
refine.gif
Description: GIF image
