Like there are literally stacks of papers in the computer graphics literature that have precisely these kinds of algorithms their proposing here. We've done this, done this, done this, and done it again over and over. What is the actual contribution supposed to be here?
-
-
Most of the Wolfram stuff I've actually looked at tends to try to get rid of the edge lengths and replace the continuous part by just counting nodes. Which is also another thing you can do, and then you're back to sort-of being able to encode everything but...
-
... then you have to get into hand-wavy territory of "well we have the same _order_ as the equation we would expect" (these are the statements like "it grows with r^2 just like equation X that we were expecting").
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.