[MUD-Dev] No Exp? (was: Exploration Exp)

[John Buehler]

msew writes:

> >    2. Compute their union (not simple)
>
> why is this "not simple"? :-)
>
> off top of my head
>
>   1) take the centers of the volumes. [O(n)]
>
>   2) compute a 3d voroni diagram [O(n log n)] (can't recall what it is
>   for 3d :-) )
>
>   3) compute intersections [O(n)]
>
>
> Maybe I am missing something :-)

You're missing something basic.  I have no idea what a Voroni diagram is.
And after a quick search on the web, I still don't know.  I spent a bit of
time trying to figure out what a Delaunay triangulation was and that came to
naught.  I clowned around with a couple different free packages on the web
for intersections and triangulations.  None of them worked out for me.  So I
wrote my own.  O(n^2)

And if MSN *worked* [grrrr], I'd post a link to the cave generator that I
built.  I'm relatively happy with the results, although I haven't applied a
fractal roughing algorithm to the interior faces yet.  And I have to work
out the collision detection structures as well...

JB

_______________________________________________
MUD-Dev mailing list
MUD-Dev at kanga.nu
https://www.kanga.nu/lists/listinfo/mud-dev