|
|
|
|
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Hello!
I have Uwe Zimmermanns GEODESIC macro that creates Tetra- Octa- and
Icosa-hedrons with X number of faces. The macro create vertices in a
two-dimensional array and choose the faces from there. The array have holes
of uninitialized elements. The output is in the form of triangle { corner1,
corner2, corner3 }
I need to convert this to a mesh2 structure, either by modifying the macro,
or build a conversion-macro that sorts the triangles into a new
one-dimensional array with no uninitialized elements, and the faces into
another. I made such a macro experiment but with just 4000 faces it takes
several minutes to parse and wastes lots of memory. Warp's Hybrid_Quicksort
macro is probably a very nice help here, but I think the process of
conversion is still too time consuming.
I'm stuck, but I need this to work.
Regards,
Hugo
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Hugo <hua### [at] post3teledk> wrote:
: by modifying the macro,
I think this is the best way to go.
--
#macro N(D,I)#if(I<6)cylinder{M()#local D[I]=div(D[I],104);M().5,2pigment{
rgb M()}}N(D,(D[I]>99?I:I+1))#end#end#macro M()<mod(D[I],13)-6,mod(div(D[I
],13),8)-3,10>#end blob{N(array[6]{11117333955,
7382340,3358,3900569407,970,4254934330},0)}// - Warp -
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
> : by modifying the macro,
>
> I think this is the best way to go.
Yes .... but a mesh2 optimised macro would mean a full rewrite of it, and
the math behind tetrahedrons are still too difficult for me.. I'm trying
something in between at the moment.. It might be another mad mans idea,
since I'm getting quite confused, but I'll post the further development..
Thanks for your input. :o)
Hugo
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
|
|