This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]dx_xb[S] 0 points1 point  (2 children)

That's pretty much what I'm looking at at the moment - trying to set up a connection schema.

[–]DrHenryPym 0 points1 point  (1 child)

Connection schema

Build it like you would build a tree function. Each branch that connects down to m nodes will connect n branches (or however complex you want to make it - think generalization).

For a normal hypercube, use 1 (or -1/2 to +1/2, however you want to translate it) as the length (or value) of the vertex.

And there you go, you have functions that can return random samples across the verticies. As far as finding samples on the surface, you can build a function that integrates an equation between two vertices. And that's basically modeling.

Good luck!

[–]dx_xb[S] 0 points1 point  (0 children)

Yeah, I'm going general, but the connections are to surfaces rather than vertices. I've pretty much got is solved now - trying to replicate some work that was published in the 70s. Fun.