Analyzing Midpoint Subdivision

11/26/2009
by   Hartmut Prautzsch, et al.
0

Midpoint subdivision generalizes the Lane-Riesenfeld algorithm for uniform tensor product splines and can also be applied to non regular meshes. For example, midpoint subdivision of degree 2 is a specific Doo-Sabin algorithm and midpoint subdivision of degree 3 is a specific Catmull-Clark algorithm. In 2001, Zorin and Schroeder were able to prove C1-continuity for midpoint subdivision surfaces analytically up to degree 9. Here, we develop general analysis tools to show that the limiting surfaces under midpoint subdivision of any degree >= 2 are C1-continuous at their extraordinary points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2015

A de Casteljau Algorithm for Bernstein type Polynomials based on (p,q)-integers

In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezie...
research
04/15/2018

Regular Polygon Surfaces

A regular polygon surface M is a surface graph (Σ, Γ) together with a co...
research
02/25/2020

Feedback game on 3-chromatic Eulerian triangulations of surfaces

In this paper, we study the feedback game on 3-chromatic Eulerian triang...
research
05/12/2022

Order-Degree-Height Surfaces for Linear Operators

It is known for linear operators with polynomial coefficients annihilati...
research
11/02/2022

The degree-restricted random process is far from uniform

The degree-restricted random process is a natural algorithmic model for ...
research
08/18/2012

General Midpoint Subdivision

In this paper, we introduce two generalizations of midpoint subdivision ...
research
11/27/2020

Nodes on quintic spectrahedra

We classify transversal quintic spectrahedra by the location of 20 nodes...

Please sign up or login with your details

Forgot password? Click here to reset