[next] [prev] [up] Date: Fri, 21 Apr 95 11:37:18 -0400
[next] [prev] [up] From: michael reid <mreid@ptc.com >
[next] [prev] [up] Subject: Re: Run Times, Storage Requirements, etc.

jerry writes

So I need a new representative element function
to make the corner more significant for choosing the representative
element. Such a change to the program would be trivial, but I would
have to regenerate the data before it was re-sorted.

i don't think you need to regenerate; you just need to put your
old list through your new representative choosing function and
sort the output. of course, regenerating would give a reasonable
consistency check.

What would be really nice (and which may not be possible) is some
representation for the cube such that a cube Z and its neighbors
Zq or Zh are stored very close together.

remember that the diameter of the group is small. (my guess is
21 face turns, 24 quarter turns.) so this isn't possible without
resorting to a liberal definition of "very close".


[next] [prev] [up] [top] [help]