10:30 AM-12:30 PM
Room: Belle Meade
Subdivision algorithms produce, from a given polygonal net, a sequence of polygons with increasingly more and denser lying vertices. Usually a next polygon in such a sequence is obtained by simple affine combinations which accounts for the attractiveness of subdivision schemes. For certain subclasses of subdivision schemes on regular nets, the convergence and the smoothness of the limiting curves or surfaces has been investigated and is well understood. More recently, the C^k-analysis for subdivision schemes on non-regular nets has been completed and attempts have been made to construct wavelets for some subdivison schemes. The speakers will discuss recent work in these topics.
Organizer: Hartmut M. Prautzsch
Universitaet Karlsruhe, Germany
GD97 Homepage | Program Updates| Registration | Hotel Information | Transportation |
Program-at-a-Glance | Program Overview | Speaker Index |