Re: [Algorithms] Geodesic Sphere
Brought to you by:
vexxed72
From: Dave E. <eb...@ma...> - 2000-08-23 14:38:34
|
From: "Adam Moravanszky" <amo...@dp...> > If I understand your explanation correctly (creating a new vertex inside the > triangle, then replacing the original edges of the triangles with different > ones), this is pretty much what Kobbelt does. The 1->4 way I had in mind > was the common tessellation approach of splitting each of the three edges of > the original to create 3 new vertices, then adding 3 new edges to form 4 > triangles. Of course 4 is correct. This is what my code does that I mentioned in an earlier post (subdivide inscribed convex polyhedron). I was thinking ahead to the first subdivision in my algorithm where I split into 3. -- Dave Eberly eb...@ma... http://www.magic-software.com |