Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!rice!comet.rice.edu!fontenot
From: fontenot@comet.rice.edu (Dwayne Jacques Fontenot)
Newsgroups: comp.graphics
Subject: recursive sphere tesselation from tetrahedral seed
Message-ID: <1991Apr15.171109.2625@rice.edu>
Date: 15 Apr 91 17:11:09 GMT
Sender: news@rice.edu (News)
Organization: Rice University
Lines: 26


Hello,

I have been playing with recursive triangular sphere tessellations. Starting
with an octahedron works beautifully, but since each triangle is split into
four triangles at each iteration, the progression of numpolys looks like this:

	8  32  128  512  2048  8192  ...

I want more flexibility in the number of polygons per sphere. So, I tried
starting with a tetrahedron, so that I could get:

	4  16  64  256  1024  4096  ...

This, plus the above would give me any power of 2, which is probably enough
flexibility...

But, the tetrahedral tessellation is giving me some strange results.
My question is this; is there a fundamental problem with starting with a 
tetrahedron? I cannot think of one... any replies will be greatly appreciated.

Thank you for your time,

Dwayne Fontenot (fontenot@comet.rice.edu)
Rice Advanced Visualization Lab (RAVL)