Re: [Algorithms] Geodesic Sphere

[Adam M. <amo...@dp...>]

The classic way to subdivide quadruples your number of triangles with every
step.  You might find Leif Kobbelt's sqrt(3) subdivision paper from this
year's siggraph interesting.  While the paper focuses on subdivision
surfaces, he describes a method of subdividing which could be applied to
arbitrary problems of tessellation.  His approach triples the number of
triangles with every step, allowing for finer LOD control.  It is in fact
very simple -- I would be surprised if no one was using this scheme before
him.

--
--Adam Moravanszky
http://www.n.ethz.ch/student/adammo

-----Original Message-----
From: Dave Eberly <eb...@ma...>
To: gda...@li...
<gda...@li...>
Date: Tuesday, August 22, 2000 3:11 PM
Subject: Re: [Algorithms] Geodesic Sphere


>From: "Aldo ." <al...@ho...>
>> I'm looking for an algoritm to create a geodesic sphere(is the name
>> correct?), a sphere made of equilateral triangles. I would be nice if I
>> could choose the resolution(more or less triangles).
>
>From: "Peter Warden" <Pet...@vi...>
>> Here's a link I've used (found on Dave Eberly's site,
>> www.magic-software.com, in the Other Links section);
>>
>> http://forum.swarthmore.edu/dr.math/problems/matz12.15.96.html
>
>Or you could just use the code (with MS Windows test program)
>at http://www.magic-software.com/gr_dcmp.htm , section with
>files sphrtesl.{h,cpp,pdf} and sptstest.cpp.  The tessellation is
>by recursive subdivision.  You start with any inscribed convex
>polyhedron.  If you want the 'classic' cases, start with an
>octahedron (part of the sptstest program) or an icosahedron.
>
>--
>Dave Eberly
>eb...@ma...
>http://www.magic-software.com
>
>
>
>_______________________________________________
>GDAlgorithms-list mailing list
>GDA...@li...
>http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list