|
![](/i/fill.gif) |
Edward Coffey wrote:
> Put simply, you can't use the order of generation to decide how to
> approximate the surface because while for any given point, n, it is
> possible that point n+1 is right next to it, it is just as likely to be
> over the other side of the object.
ah, i didn't know that. instead of a guessing-algorithm one could also
use several steps to create a surface:
1) create all points and store them in a file
2) create triangles from them by taking one point and finding the 2
closest point
step two would be very cpu-time-consuming, as far as i know, so it's not
a very efficient way.
ciao,
Marc
Post a reply to this message
|
![](/i/fill.gif) |