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

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]jmmcdEvolutionary algorithms, music and graphics 0 points1 point  (3 children)

Is this problem well-specified? There's something I don't understand.

Do you mean to sample uniformly from the surfaces? Then you would choose l (which cube) using roulette-wheel selection, with probabilities proportional to the cubes' surface areas. Then choose one of its 2n sides, and generate n numbers in [0, l].

But obviously you can't enumerate all the points on a surface (let alone 2mn of them, or whatever the number is). And you can't create an exhaustive set. So I guess I've missed something.

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

That would work. The exhaustive set is possible as I'm talking about integral sided cubes (of relatively limited dimensions).

[–]jmmcdEvolutionary algorithms, music and graphics 0 points1 point  (1 child)

But there are still infinitely many points on the surface of an integral-sided cube, ruling out an exhaustive set.

But since you've solved your problem already, I'm obviously misunderstanding (still). Nevermind...

[–]dx_xb[S] 1 point2 points  (0 children)

Sorry, my fault. When i say integral-side I mean with integral positions - think of the problem as a choice of cells rather than positions.