|
 |
On Sat, 30 Dec 2000 18:40:37 -0500, Chris Huff wrote:
>In article <3a4e6e6c$1@news.povray.org>, "Jan Walzer" <jan### [at] lzer net>
>wrote:
>
>> It should be go with a recursive algorithm .... (sounds like StarTrek,
>> heheeee ...)
>
>...snip...
>
>That won't let you specify a specific number of triangles to use, only a
>recursion level. The number of triangles increases rather rapidly with
>recursion level.
One way to provide more options is to also allow starting with a regular
octahedron or icosahedron.
My golfball code (at the address below) contains the germ of this algorithm
for a starting point of an icosahedron. It only generates the vertices,
not the triangles, but it might be a good starting point. I've been meaning
to generalize it a little (replace the constant #defines with a smaller number
of constant #defines) but I haven't gotten around to it yet.
--
Ron Parker http://www2.fwi.com/~parkerr/traces.html
My opinions. Mine. Not anyone else's.
Post a reply to this message
|
|
