See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/261359062

Subdivision Surface Algorithm Based on a Novel Hexagonal Vertex-To-Vertex

Subdivision Scheme

Article · December 2005

CITATIONS READS

0 414

1 author:

Yasser Abd El-Latif

Ain Shams University
22 PUBLICATIONS   49 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Perfect matching View project

Meshes Compression View project

All content following this page was uploaded by Yasser Abd El-Latif on 07 October 2014.

The user has requested enhancement of the downloaded file.

 Subdivision Surface Algorithm Based on A Novel
Hexagonal Vertex-To-Vertex Subdivision Scheme
Fayed F. M. Ghaleb Yasser M. Abd El-Latif*

Ain Shams University

Faculty of Science
Math. & Comp. Sc. Dept.
Abbassia, Cairo, Egypt

environment. Validation of our approach is

Abstract
One problem in subdivision surfaces is the
number of meshes grows quickly after every
subdivision step. The surface with huge number
of meshes is difficult to manipulate. In this
paper we propose a hexagonal scheme which
can be considered as a modification to Doo-
Sabin scheme. We introduce recursive
subdivision rules for meshes with arbitrary
topology, optimizing the surface continuity
given a minimal support area. These rules have
simplicity comparable to the [25] scheme. Doo-
Sabin subdivision scheme defined three types of
new faces created during the construction of the
new mesh namely: face-face, an edge-face, and
a vertex-face. Alternatively, our proposed
vertex-to-vertex subdivision scheme produces
the following three types: face-face, an edge-
face, and a vertex-vertex. Consequently,
increasing the smoothness of the surfaces and
decreasing the running time. Surfaces
smoothness and complexity time of our
proposed algorithm are analyzed and compared
with existing methods. The original contribution
and advantages of our proposed technique over
existing methods are that, the proposed
technique produces good- quality surface
approximations without too many faces during
the construction process, simple to implement,
reliable in which it can be applicable to any
surface mesh, optimizing the surface continuity,
has certain desirable properties, achieves
numerical stability for the surfaces and its
computations are fast enough for an interactive
_______________________________________
*Yassermal2002@Yahoo.com
given by discussion, analysis and an illustration
of some experimental results.
Keywords: Subdivision surfaces,
Computational Geometry, Subdivision scheme,
Boundary control, Geometric modeling,
Meshes, Computer Graphics and Animation.
1. Introduction
Subdivision surfaces are powerful tools for
graphical modeling and animation because of
their scalability, numerical stability, simplicity
in coding, fast generation of high quality
surfaces and especially, their ability to represent
free-form surfaces of arbitrary topology [1], [2].
Subdivision algorithms are also attractive
because they are conceptually simple and can be
easily modified to create surface features
without making major changes to the algorithm.
Nowadays the subdivision algorithms are
commonly used in films to model the computer
graphics scenes and characters [3] and their
study is still gaining interest due to their close
relation to wavelet and multi-resolution analysis
[30], [31], [32], [33], [35]. A number of
commercial systems use subdivision as a surface
representation like Pixar`s Render-man,
Nichimen`s Mirai, Micropace` Lightwave 3D,
etc. Surface subdivision is a technique for
generating smooth surfaces that has been
introduced quite some time ago by Catmull-
Clark [4] and Doo-Sabin [5]. The Basic idea of
the subdivision surfaces [1], [2] is to calculate
smoother surface from the current surface mesh.
In the beginning there is an initial control point
mesh, which is refined by the sequence of
successive calculation. The initial mesh can be
arbitrary and it can contain any number of
vertices and faces. Sequence of refinements is
based on set of rules. This kind of rule set is
called as subdivision scheme. A number of
subdivision schemes have been propose so far
and may be sorted into two categories.
Approximation techniques move all the vertices
of the mesh, whereas interpolation techniques
keep the vertices of the control mesh
unchanged. Approximation techniques have
been most extensively studied, as they tend to
produce better shapes and are more flexible. In
contrast, interpolation techniques preserve the
vertices of the control mesh, but the fairness of
the surface is more difficult to control. The type
of subdivision scheme proposed in this paper is
an approximation.
The paper is organized as follows. Section 2,
reviews some of the prior researches in
subdivision surfaces and its challenging. Section
3, gives a brief summary of the Doo-Sabin
subdivision scheme and its subdivision
problems. Section 4, introduces our proposed
algorithm for surface subdivision. Some
experimental results with discussions are given
in sections 5. Analysis of our proposed
algorithm compared with existing methods is
discussed in sections 6. Finally, in section 7, we
conclude this paper with some direction for
future work.
2. Prior Research
Subdivision surfaces are rapidly gaining
popularity in computer graphics and other
applied areas. A number of subdivision schemes
have been proposed since Catmull-Clark [4] and
Doo-Sabin [5] introduced subdivision surfaces
in 1978. Nasri [6] extended Doo-Sabin surface
to interpolate vertices of original polyhedron
and B-spline curves on the subdivision surface.
Nasri [7], [8] further describes methods to create
creases and borders for the dual Doo-Sabin
scheme. He augments the object with polygonal
2
strips, which converges to a specific B-Spline.
Sederberg et al. [9] add support for sharp edges
to the Catmull-Clark and Doo-Sabin schemes by
introducing non-uniform knot vectors. Sharp
edges are created in Doo-Sabin surfaces by
setting knot spaces along certain control edges
to zero. N. Dyne et al. [10] proposed a butterfly
subdivision scheme, it is an interpolating
scheme that extended by Zorin et al. [11] to
guarantee the C1 continuity for arbitrary meshes.
Subdivision schemes, which operate on
triangular meshes were proposed and discussed
by Farin [12] and Loop [13]. Hoppe et al.
modified the subdivision rules to add borders to
Loop surfaces [14]. They also provide support
for creases, by uncoupling the crease curve from
the surface from both sides [14]. Although the
Loop scheme [13] has been tested, it can be
adapted to other schemes. Mandal et al. [15]
have proposed a scheme for dynamic
manipulation of the limit surface created with
the modified Butterfly scheme [10], [11] using
physically based force controls. The control is
provided by tracking vertices at various levels
of the subdivision. Volino [16] uses blended
spheres to perform a N-adic tessellation of
triangles. Points and normals from the initial
mesh are directly involved in its construction.
Vlachos [17] uses a N-dic tessellation to
perform his PN Triangles (or N-patches). Later,
a new class of interpolating N-adic subdivision
algorithm has been proposed in [18]. Some
other methods deal with the deformation of the
surface by modifying the normals at the vertices
of the control mesh. For instance, Halstead et al.
[19] has improved the Catmull-Clark [4] scheme
in order to directly generate the limit surface.
Conditions for interpolating normals are given.
Unfortunately, using normals to control the limit
surface dramatically increases the resolution
cost. Biermann and Levin provide the Catmull-
Clark and Loop schemes with flexible support
for borders and normal control [20], [21]. They
also observed that in certain situations it is
interesting to employ different rules for convex
and concave borders. Levin [22] further
extended the boundary to allow arbitrary
parametric curves for interpolating a network of
curves. Velho and Zorin add support for smooth
borders to their 4-8-subdivision scheme [23].
Kobbelt scheme [24] is basically like 4-8-
subdivision scheme [23] but the basic tiling is 3-
6. Recently schemes that operate on the dual of
triangular meshes – namely hexagonal meshes -
were investigated by Claes et al [25] and Beets Figure 1 Chaikin`s Algorithm
et al. [26]. Another adaptive subdivision
schemes have been proposed in Muller [27], Doo-Sabin adapted the refinement techniques
[28], [29]. Compared with the previous for the quadratic uniform B-spline surface and
mentioned work, this paper proposed a new developed a new surface definition procedure
subdivision scheme such a hexagonal scheme. based upon refinement. In Doo-Sabin method,
We introduce recursive subdivision rules for surfaces are generated from polyhedral
meshes with arbitrary topology, optimizing the networks by successively cutting the corners
surface continuity given a minimal support area. and edges of the polyhedron. Its procedure is
These rules have a simplicity comparable to the based on the observation that the points are
Doo-Sabin scheme. The advantages of our simply the average of four particular points
proposed technique are that, it produces good- taken in a polygon - the vertex for which the
quality surface approximations without too new point is being defined, the two edge points
many faces during the construction process, (the midpoints of the edges that are adjacent to
simple to implement, reliable in which it can be this vertex in the polygon), and the face point
applicable to any surface mesh, optimizing the (the centroid of the polygon).
surface continuity, has certain desirable
properties, achieves numerical stability for the
surfaces and its computations are fast enough
for an interactive environment.

3. Doo-Sabin Subdivision Surfaces and

Problems
The fundamental idea of Doo-Sabin subdivision
surfaces goes back to Chaikins algorithm [34],
which generates a quadratic B-spline curve from Figure 2 Doo-Sabin Subdivision Process
a polygon by successively cutting its corners.
Each subdivision generates two new points on Figure 2 illustrates such procedure, where the
each polygon leg at (1/4,3/4). For the polygon polygon face P 0P1P 2P3 is generated from the
shown in Figure 1 with n vertices (Vi)0<i<n+1 on polygon face P0 P1 P2 P3 as follows:
polygon leg (Vi,Vi+1), two new points are given
by the following:
V i   3 / 4 V i  1 / 4 V i  1 , V i  1  1 / 4 V i  3 / 4 V i  1 .
Then the new polygon is linked by the new
generated points (V i , V i  1 ) corresponding to
(Vi)0<i<n+1. By repeating the subdivision process,
we can get a quadratic B-spline curve.

3
 through a set of rules called subdivision scheme.
The Doo-Sabin subdivision scheme defined
three types of new faces created during the
construction of the new mesh namely: face-face,
an edge-face, and a vertex-face. Figure 3
illustrates these new faces, which are created as
described below:

 Face-face (F-face): For each n-sided face, a

new small n-sided face is generated inside
that face. This new face is called F-face.
 Edge-face (E-face): For each edge,
connecting the new vertices adjacent to that
edge produces a four-sided face. This new
face is called E-face.
 Vertex-face (V-face): For each vertex,
In general, the equations to compute the new connecting the new vertices adjacent to a
points from the old ones are linear in the points vertex produces a new face. This new face is
and hence may be expressed in matrix form. For called V-face.
any regular face ABCD, we can obtain a new
face A  B C D  from the following expression:

A  B C D   S ( ABCD ),

where ,

9 3 1 3
 
3 9 3 1
S  1 / 16  
1 3 9 3
 
3 1 3 9
is the Doo-Sabin subdivision matrix for a
quadrilateral face. In triangle mesh, for any Figure 3 Three Types of Faces in Doo-Sabin surfaces.
regular face ABC, we can obtain a new face
A  B C " from the following expression: In the Doo-Sabin subdivision scheme and after
several subdivision steps, the generated
A  B C   S ( ABC ), subdivision surface will be smooth enough to
where , represent a fine shape. But even after few
subdivision steps, the number of generated
14 5 5 
meshes will become huge consequently difficult
 
S  1 / 24 5 14 5 to manipulate and the number of faces grows
 
 5 5 14  exponentially. Due to memory and time
restrictions, the number of subdivision steps that
is the Doo-Sabin subdivision matrix for a
can be performed is relatively small. The reason
triangle face.
for this problem is due to the three types (F-
face, E-face, and V-face) produced by the Doo-
The idea of the subdivision is to calculate a
Sabin subdivision scheme in which each vertex,
smoother surface from the current surface mesh
edge and n-sided face produces a new face
4
during the recursive construction process. For
instance, in the Doo-Sabin subdivision surfaces,
the number of meshes after one refinement step
is about four times that of the original meshes.
Thus, it is difficult to deal with these data,
consequently adaptive techniques are still
necessary to manage the exponential growth of
the number of new polygons created during the
subdivision process. This paper proposes such
an adaptive technique to produce a hexagonal
scheme which we call vertex-to-vertex
subdivision scheme. The advantages of this
scheme are that, it generates soft meshes with
less polygon than Doo-Sabin method, generates
a hexagonal scheme without need to suitable
methods to convert a triangular to a hexagonal
as in [25], produces good-quality surface
approximations without too many faces during
the construction process, has certain desirable
properties, efficient in time complexity, simple
to implement, and achieves numerical stability
for the surfaces.
4. Our Proposed Vertex-to-Vertex
Subdivision Scheme
The problem with the Doo-Sabin subdivision
scheme is that the subdivision process produces
a sequence of meshes with increasing number of
faces. These faces grow quickly after every
subdivision step, consequently difficult to
manipulate. In this section an adaptive process
for reducing the number of faces after every
subdivision step with the Doo-Sabin subdivision
scheme is presented. The Doo-Sabin subdivision
scheme defined three types of new faces created
during the construction of the new mesh
namely: face-face, an edge-face, and a vertex-
face. Alternatively, our proposed vertex-to-
vertex subdivision scheme produces the
following three types: face-face, an edge-face,
and a vertex-vertex. The objective of the
proposed approach is to optimize the surface
continuity and to manage the exponential
growth of the number of new faces created by
the subdivision process. Let us consider V one
5
of the corner points of the cube. Let the points
P1, P2, P3 be the new face points corresponding
to vertex V created according to the Doo-Sabin
subdivision scheme. In our proposed
subdivision scheme, we calculate a new vertex
V` corresponding to vertex V instead of the face
P1 P2 P3 by averaging the four points P1, P2, P3
and V as shown in Figure 4. This process is
repeated for every construction process.
Figure 4 Vertex-to-Vertex illustrations with our
proposed algorithm.
The pseudo-code of our proposed algorithm is
given as follows:
Procedure Subdivision
Stage 1: For each face f do
- Calculates the set of new points
in this face f by the Doo-Sabin
process;
- Connects these new points in
order to construct a new face;
- Add the necessary new edges;
End;
Stage 2: For each vertex v do
- Calculate a new point
corresponding to the vertex v
by averaging all of the new
points that have been generated
for the faces that are adjacent
to this vertex v including itself;
End;
Stage 3: For each edge e do
If the two adjacent faces for e
have not the same normal then
- Construct a new face by
connects the new points that
have been generated for the
 faces and vertices that are L
adjacent to this edge e;
Otherwise,
- Construct a new face by
connects the new points that
have been generated for the 0
faces only that are adjacent to
this edge e;
End if;
- Add the necessary new edges;
End; 1
The polygons generated through this refinement
step become the input set of polygons for the
next iteration step.

5. Experimental Results and Discussion

Based on our proposed algorithm, several 2
experimental results with animation have been
performed over an arbitrary initial control mesh.
Figure 5(a), illustrates a pentagon and it’s the
Doo-Sabin surfaces in different subdivision
steps. Figure 5(b) shows an animation sequence
of the same pentagon using our proposed
subdivision algorithm. Figures 6 demonstrate 3
other smooth subdivision process with the
second level from an arbitrary initial control
mesh using our proposed subdivision algorithm.
From the experimental results one can see that
in compared with the Doo-Sabin Subdivision
algorithm, our proposed subdivision algorithm
posses the following advantages. First, produces 4
good-quality surface approximations without
too many faces during the construction process.
Second, optimizing the surface continuity and
has certain desirable properties. Third, achieves
numerical stability for the surfaces. Finally, the
proposed technique is efficient in time
complexity and simple to implement, 5
consequently, fast enough for an interactive
environment. Such advantages are proved in
terms of the analysis discussed in the next
(a) (b)
section.
Figure 5 An illustration of the subdivision process of
the pentagon using (a) Doo-Sabin algorithm and (b)
our proposed subdivision algorithm.

6

Figure 6 Subdivision surfaces with an arbitrary
control mesh
6. Analysis
The subdivision process produces a sequence of
polyhedron with increasing numbers of faces
and vertices. Subdivision surfaces are the limit
of this sequence. This section analyzes the
surfaces smoothness of our proposed algorithm
compared with the [25], and Doo-Sabin
subdivision algorithms. The key of the
7
algorithm is to construct the connectivity of the
output mesh correctly, and one would like to
accomplish this task efficiently. As discussed in
section 3 and shown in Figure 3, the Doo-Sabin
subdivision scheme defined three types of new
faces created during the construction of the new
mesh namely: (F-face, E-face and V-face). After
few subdivision steps, the number of generated
meshes will become huge and the number of
faces grows exponentially, consequently
difficult to manipulate. Compared with the Doo-
Sabin subdivision scheme, our proposed
algorithm reducing the number of faces after
every subdivision step and only creates two face
types F-face and E-face. The V-face type is lead
to another vertex and not face, consequently,
generating a hexagonal scheme. This scheme
will increase the smoothness of the surfaces and
decrease the running time comparing with Doo-
Sabin scheme. Also this scheme prevents the
coarse area that occurs with Doo-Sabin scheme
see Figure 5 with level 5.
Figure 7. A subdivision of a regular mesh with a factor
of three and four.
It turns out there exist many ways in which a
hexagonal grid can be recursively refined. The
first two non-trivial of the possible subdivisions
multiply the number of hexagons by
respectively three and four. A scaling factor of
three is investigated in a paper by Johan Claes,
Koen Beets, and Frank Van [25]. A scaled-
down version of the input hexagon is dropped in
its center, after which the new vertices are
reconnected to the nearest new vertices,
replacing each old vertex by a new hexagon (as
in the left image of Figure 7). This can be
viewed as an corner-cutting operation. This
setup introduces one type of new vertex as in
the Doo-Sabin scheme and every subdivision
step removes the vertices of the previous steps.
However, contrary to Doo-Sabin’s scheme, our
hexagonal scheme needs to keep the existing
vertices. So two types of rules are needed: one
for the new vertices, and possibly one for
relaxing the position of the old ones. Such a
scheme with a multiplication factor of four
would be the dual of triangular schemes that
split triangles into four, such as Charles Loop’s
scheme [13]. As this scheme for hexagonal
subdivision does not have a fixed name yet, we
propose to call it the hexagon vertex-to-vertex
scheme.
6.1 Smoothness
After the application of the refinement rule to
the complex mesh M = (V, E, F), the set of
newly inserted vertices V` of M`, can be
naturally divided into two classes: new vertices
corresponding to each face which we will call
F-vertices, and new vertices corresponding to
each vertex which we call V-vertices. The
smoothing operator is a convolution filter. It
uses a different smoothing rule for each class of
vertices.
The stencil for F-vertices is depicted as used in
Doo-Sabin method (face mask). The stencil for
V-vertices is depicted in Figures 8, 9 (vertex
mask). Observe that the filter kernel extends
beyond the first neighbors of the vertex. It
corresponds to a smoothing filter based on 1-
neighbors before the introduction of new
vertices.
Figure 8. Filter masks for V-vertex (vertex mask) in
case quadrilateral mesh with (a) Interior vertex and
(b) Exterior vertex.
8
Figure 9. Filter masks for V-vertex (vertex mask) in
case triangles mesh with (a) Interior vertex and (b)
Exterior vertex.
The smoothing operator can be implemented
very efficiently using repeated convolution by a
sequence of averaging operations. In a first pass,
F-vertices are calculated as Doo-Sabin method.
In a second pass, V-vertices are updated as the
average of their current value and the average of
the values of new vertices in their 1-
neighborhood. It is easy to verify that this
procedure corresponds to the stencils in Figures
8, 9.
The masks for quadrilateral or triangle face can
be calculated by using Doo-Sabin matrix as
describe in section 3; vertex mask coefficients
depend on k, the number of incident block faces.
In the case shown in the figures 8(a), 9(a), k = 7.
However, it is often necessary to model surfaces
with boundary, which may contain sharp
features as well. Thus, it is of practical
importance to extend our subdivision scheme to
support surfaces with smooth boundaries and
creases. Furthermore, it is often useful to have
surfaces with piecewise smooth boundary. Here
we present only the rules for smooth boundaries.
Figures 8(b), 9(b) illustrate the V-vertex belongs
to the boundary quadrilateral and triangle mesh
respectively, vertex mask coefficients depend on
k, the number of incident block faces. In the
case shown in the figures, k = 4 for quadrilateral
and triangle meshes. As we see that the same
rules have to be applied in the neighborhood of
corner vertices on the boundaries and creases,
except the adjacent boundary vertices for this  13 4 1 1 1 4 
vertex.  
 4 13 4 1 1 1 
 1 4 13 4 1 1 
A geometric interpretation of our scheme is 1
M   
6
available which we now employ to analyze the 24  1 1 4 13 4 1 
rule for quadrilateral and 6-gon mesh. Let P 1 ,  
1 1 1 4 13 4
 
P 2 , P 3 and P 4 be the four vertices of a regular  
 4 1 1 1 4 13 
square face as shown in Figure 10(a). A new set
of vertices q 1 , q 2 , q 3 , and q 4 , is generated by is the subdivision matrix for a triangle face.
application of the simple linear expression This matrix has the following eigenvalues:
 q 1 , q 2 , q 3 , q 4   M 4  P1 , P2 , P3 , P4  where
T T

 0  1

9 3 5

3 1
  1 ,  2 
8
1 3 9 3 1
M  3
4  3  3,4 
16 1 3 9
  8
 
3 1 3 9
1
 5 
4
is the subdivision matrix for a regular face of 4-
sided. In the literature [5], [36], [2], the following is
This matrix has the following eigenvalues: reported about the nature of the eigenvalues of
the subdivision matrix M 6 :
 0  1
1 o The largest eigenvalue should be 1. This is
 1 ,  2 
2 necessary for the scheme to be affine
1 invariant.
 3 
4
o The second and third largest eigenvalues
In similar way, we can apply this refinement (sorted by their absolute values) should
rule for 6-Gon faces. Let P 1 , P 2 , P 3 , P 4 , P 5 and be equal, and they should be strictly
larger than the next eigenvalues for the
P 6 be the vertices of a 6-Gon face as shown in
scheme to be C1 .
Figure 10(b). A new set of vertices q 1 , q 2 , q 3 ,
q 4 , q 5 and q 6 , is generated by application of o The fourth and fifth eigenvalues should be
the simple linear expression equal, and this indicates that there will be no
tangent vector at the central point.
 q 1 , q 2 , q 3 , q 4 , q 5 , q 6   M 6  P1 , P2 , P3 , P4 , P5 , P6 
T T

o These eigenvalues are related to the out-of-

where the-plane behavior of the configuration.

9

(a)
(b)
Figure 10. Filter masks for face mask in case (a)
quadrilateral mesh or (b) 6-Gon mesh.
7. Conclusions and Future Work
Subdivision surfaces are efficient tools for fast
generation of high quality surfaces and have
been in the highlights of the computer graphics
community for the past few years. Nowadays,
the subdivision algorithms are commonly used
in films to model the computer graphics scenes
and characters. The problem with the
subdivision algorithms are that after few
subdivision steps, a number of generated
meshes will become huge and the number of
faces grows exponentially, consequently
difficult to manipulate. Due to memory and time
restrictions, the number of subdivision steps that
can be performed is relatively small. For
instance, in the Doo-Sabin subdivision surfaces,
the number of meshes after one refinement step
is about four times that of the original meshes.
This paper proposes a new subdivision
technique called vertex-to-vertex subdivision
scheme as a key solution for such a challenge.
The objective of the proposed technique is to
reduce the huge number of meshes generated in
the Doo-Sabin surfaces, prevent the coarse area
10
that can be generated in Doo-Sabin and manage
the exponential growth of the number of new
polygons created during the subdivision process.
The original contribution and advantages of the
proposed technique compared with previous
techniques are that, the proposed technique
produces good-quality surface approximations
without too many faces during the construction
process, simple to implement, reliable in which
it can be applicable to any surface mesh,
optimizing the surface continuity, has certain
desirable properties, achieves numerical
stability for the surfaces and its computations
are fast enough for an interactive environment.
We are currently working on a rendering system
for both interactive and realistic rendering that
only generates these parts of the geometry that
are visible and disposes of the mesh parts that
have already been rendered.
References
[1] Subdivision for modeling and animation.
SIGGRAPH 2000 Course notes.
[2] M. Sabin, “Subdivision: Tutorial notes”,
Tutorial of IEEE Shape Modelling and
Applications International Conference
(SMI`2001), May 2001.
[3] T. DeRose, M. Kass, and T. Truong,
“Subdivision surfaces in character
animation”, SIGGRAPH`1998, pp. 85-94,
1998.
[4] Ed Catmull and J. Clark, “Recursively
generated B-Spline surfaces on arbitrary
topological meshes”, Computer Aided
Design, Vol. (10), No. 6, pp.350-355, 1978.
[5] D. Doo and M. Sabin, “Analysis of the
behaviour of recursive division surfaces
near extraordinary points”, Computer Aided
Design, Vol (10), No. 6, pp.356-360, 1978.
[6] A. Nasri, “Polyhedral subdivision methods
for free-form surfaces”, ACM Trans. On
Graphics, Vol (6), No. 1, pp.29-73, 1987.
[7] A. Nasri, “Interpolating meshes of
boundary intersecting curves by subdivision
 surfaces”, The Visual Computer, Vol (16),
No. 1, pp.3-14, 2000.
[8] A. Nasri, “Constructing polygonal
complexes with shape handles for curve
interpolation by subdivision surfaces”,
Computer Aided Design, Vol (33),
pp.753-765, 2001.
[9] T. Sederberg, J. Zheng, J. Sewell and M.
Sabin. “Non-Uniform recursive subdivision
surfaces ”, SIGGRAPH`1998, pp. 387-394,
1998.
[10] N. Dyne, D. Levin and J. Gregory, “A
Butterfly subdivision scheme for surface
interpolation with tension control”, ACM
Trans. On Graphics, Vol (9), No. 2, pp.160-
169, 1990.
[11] D. Zorin, P. Schroder, and et. Al.,
“Interpolating subdivision for meshes with
arbitrary topology”, SIGGRAPH`1996, pp.
189-192, 1996.
[12] G. Farin “Designing C1 surfaces consisting
of triangular cubic patches”, Computer
Aided Design, Vol (14), pp.253-256, 1982.
[13] C. Loop, “Smooth subdivision surfaces
based on triangles”, Univ. of Utah, Math.
Dept., Master Thesis, 1987.
[14] H. Hoppe, T. DeRose, et. Al., “Piecewise
smooth surface reconstruction”,
SIGGRAPH`1994, pp. 295-302, 1994.
[15] C. Mandal, H. Qin, and C. Vermuri,
“Dynamic modeling of Butterfly
Subdivision surfaces”, IEEE Trans.
Visualisation and Computer Graphics, Vol
(19), No. 3, pp. 427-436, 2000.
[16] P. Volino and N Magenant Thalmann, “The
Spherigon: a simple polygon patch for
smoothing quickly your polygonal meshes”,
Proc. of IEEE Computer Animation`98, pp.
72-79, 1998.
[17] A. Vlachos, J. Peters, C. Boyed and J.
Michell, “Curved PN Triangles”, ACM
Symposium on Interactive 3D Graphics, pp.
159-166, 2001.
[18] G. Salomon, A. Leclercq, S. Akkouche and
E. Gallin, “Normal Control using N-adic
Subdivision Schemes”, Proc. of IEEE
11
Shape Modeling and Applications
International Conference, pp. 21-28, 2002.
[19] M. Halstead, M. Kass and T. DeRose, “Fair
Interpolation using Catmul-Clark surfaces”,
SIGGRAPH`1993 Proceeding, pp. 35-44,
1993.
[20] H. Biermann, A Levin and D Zorin,
“Piecewise smooth subdivision surfaces
with normal control”, SIGGRAPH`2000
Conf. Proc., pp. 113-120, 2000.
[21] A. Levin, “Combined subdivision schemes
for the design of surfaces satisfying
boundary conditions”, Computer Aided
Geometric Design, Vol (16), No. 5, pp.345-
354, 1999.
[22] A. Levin, “Interpolating nets of curves by
smooth subdivision surfaces”,
SIGGRAPH`1999 Proceeding, pp. 57-64,
1999.
[23] L. Velho and D. Zorin, “4-8 Subdivision”,
In Computer Aided Geometric Design, Vol
(16), No. 5, pp.397-427, 2001.
[24] L. Kobbelt, “Sqrt(3) Subdivision”,
SIGGRAPH`2000 Conf. Proceeding, pp.
103-112, 2000.
[25] J. Claes, K. Beets, and V. Frank, “A
Corner-cutting Scheme for hexagonal
Subdivision Surfaces”, Proc. of IEEE Shape
Modeling and Applications International
Conference, pp. 13-20, 2002.
[26] K. Beets, J. Claes, and V. Frank, “Borders,
semi-Sharp Edges and Adaptivity for
Hexagonal subdivision surface schemes ”,
Advances in Modeling, Animation and
Rendering, Springer-Verlag, pp. 151-166,
2002.
[27] H. Mueller and R. Jaeschke, “Adaptive
subdivision curves and surfaces”, Proc.
IEEE Computer Graphics International
Conference, pp. 48-58, 1998.
[28] L. Kobbelt, “Interpolatory subdivision on
open Quadrilateral nets with arbitrary
topology”, Computer Graphics Forum,
EuroGraphics`1996, pp. 409-420, 1996.
[29] Z. Xu, and K. Kondo, “Adaptive
Refinements in Subdivision Surfaces”,
 Computer Graphics Forum,
EuroGraphics`1999, pp. 239-242, 1999.
[30] D. Zorin, P. Schroder and W. Sweldens,
“Interactive Multi-resolution Mesh
Editing”, SIGGRAPH`1997 Proceeding, pp.
159-168, 1997.
[31] I. Guskov, W. Sweldens, and P. Schroder,
“Multi-resolution signal processing for
meshes” SIGGRAPH`99, pp. 325-334,
1999.
[32] L. Kobbelt et al., “Interactive multi-
resolution modeling on arbitrary meshes”,
SIGGRAPH`98, pp. 105-115, 1998.
[33] B. Jawerth and W. Sweldens , “An
overview of wavelet based multi-resolution
analysis”, SIAM Review, Vol. 36, No. 3,
pp. 377-412, 1994.
[34] G. M. Chaikin, “An Algorithm fo High-
Speed Curve Generation”, Computer
Graphics and Image Processing, 3, pp. 346-
349, 1974.
[35] U. Reif, “A Unified Approach to
Subdivision Schemes near Extraordinary
Vertices,” in Computer Aided Geometrical
Design, 12(2), pp.153-174, 1995.

12

View publication stats