Improved Triangular Subdivision Schemes

13 years 8 months ago

Download i33www.ibds.uni-karlsruhe.de

In this article we improve the butterfly and Loop's algorithm. As a result we obtain subdivision algorithms for triangular nets which can be used to generate G1- and G2surfaces, respectively.

Hartmut Prautzsch, Georg Umlauf

Real-time Traffic

CGI 1998 | Computer Graphics | Subdivision Algorithms | Triangular Nets |

claim paper

» On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches

» MeshToSS Converting Subdivision Surfaces from Dense Meshes

» Surface interpolation of meshes by geometric subdivision

» Designing composite triangular subdivision schemes

» Analyzing a generalized Loop subdivision scheme

» Local Wavelets Decomposition for 3D Surfaces

» NonReplicating Indexing for OutOfCore Processing of SemiRegular Triangular Surface Meshes

» FEMBased Dynamic Subdivision Splines

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	CGI
Authors	Hartmut Prautzsch, Georg Umlauf

Comments (0)

Sciweavers

Improved Triangular Subdivision Schemes

CGI 1998 | Computer Graphics | Subdivision Algorithms | Triangular Nets |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers