Point-Normal Subdivision Curves and Surfaces

This paper proposes to generalize linear subdivision schemes to nonlinear subdivision schemes for curve and surface modeling by refining vertex positions together with refinement of unit control normals at the vertices. For each round of subdivision, new control normals are obtained by projections of linearly subdivided normals onto unit circle or sphere while new vertex positions are obtained by updating linearly subdivided vertices along the directions of the newly subdivided normals. Particularly, the new position of each linearly subdivided vertex is computed by weighted averages of end points of circular or helical arcs that interpolate the positions and normals at the old vertices at one ends and the newly subdivided normal at the other ends. The main features of the proposed subdivision schemes are three folds: (1) The point-normal (PN) subdivision schemes can reproduce circles, circular cylinders and spheres using control points and control normals; (2) PN subdivision schemes generalized from convergent linear subdivision schemes converge and can have the same smoothness orders as the linear schemes; (3) PN $C^2$ subdivision schemes generalizing linear subdivision schemes that generate $C^2$ subdivision surfaces with flat extraordinary points can generate visually $C^2$ subdivision surfaces with non-flat extraordinary points. Experimental examples have been given to show the effectiveness of the proposed techniques for curve and surface modeling.Comment: 30 pages, 17 figures, 22.5M

Geometric Structures on Matrix-valued Subdivision Schemes

Surface subdivision schemes are used in computer graphics to generate visually smooth surfaces of arbitrary topology. Applications in computer graphics utilize surface normals and curvature. In this paper, formulas are obtained for the first and second partial derivatives of limit surfaces formed using 1-ring subdivision schemes that have 2 by 2 matrix-valued masks. Consequently, surface normals, and Gaussian and mean curvatures can be derived. Both quadrilateral and triangular schemes are considered and for each scheme both interpolatory and approximating schemes are examined. In each case, we look at both extraordinary and regular vertices. Every 3-D vertex of the refinement polyhedrons also has what is called a corresponding “shape vertex.” The partial derivative formulas consist of linear combinations of surrounding polyhedron vertices as well as their corresponding shape vertices. We are able to derive detailed information on the matrix-valued masks and about the left eigenvectors of the (regular) subdivision matrix. Local parameterizations are done using these left eigenvectors and final formulas for partial derivatives are obtained after we secure detailed information about right eigenvectors of the subdivision matrix. Using specific subdivision schemes, unit normals so obtained are displayed. Also, formulas for initial shape vertices are postulated using discrete unit normals to our original polyhedron. These formulas are tested for reasonableness on surfaces using specific subdivision schemes. Obtaining a specified unit normal at a surface point is examined by changing only these shape vertices. We then describe two applications involving surface normals in the field of computer graphics that can use our results

PARAMETRIZATION AND SHAPE RECONSTRUCTION TECHNIQUES FOR DOO-SABIN SUBDIVISION SURFACES

This thesis presents a new technique for the reconstruction of a smooth surface from a set of 3D data points. The reconstructed surface is represented by an everywhere -continuous subdivision surface which interpolates all the given data points. And the topological structure of the reconstructed surface is exactly the same as that of the data points. The new technique consists of two major steps. First, use an efficient surface reconstruction method to produce a polyhedral approximation to the given data points. Second, construct a Doo-Sabin subdivision surface that smoothly passes through all the data points in the given data set. A new technique is presented for the second step in this thesis. The new technique iteratively modifies the vertices of the polyhedral approximation 1CM until a new control meshM, whose Doo-Sabin subdivision surface interpolatesM, is reached. It is proved that, for any mesh M with any size and any topology, the iterative process is always convergent with Doo-Sabin subdivision scheme. The new technique has the advantages of both a local method and a global method, and the surface reconstruction process can reproduce special features such as edges and corners faithfully

Isogeometric FEM-BEM coupled structural-acoustic analysis of shells using subdivision surfaces

We introduce a coupled finite and boundary element formulation for acoustic scattering analysis over thin shell structures. A triangular Loop subdivision surface discretisation is used for both geometry and analysis fields. The Kirchhoff-Love shell equation is discretised with the finite element method and the Helmholtz equation for the acoustic field with the boundary element method. The use of the boundary element formulation allows the elegant handling of infinite domains and precludes the need for volumetric meshing. In the present work the subdivision control meshes for the shell displacements and the acoustic pressures have the same resolution. The corresponding smooth subdivision basis functions have the $C^1$ continuity property required for the Kirchhoff-Love formulation and are highly efficient for the acoustic field computations. We validate the proposed isogeometric formulation through a closed-form solution of acoustic scattering over a thin shell sphere. Furthermore, we demonstrate the ability of the proposed approach to handle complex geometries with arbitrary topology that provides an integrated isogeometric design and analysis workflow for coupled structural-acoustic analysis of shells

Recursive subdivision algorithms for curve and surface design

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, the author studies recursIve subdivision algorithms for curves and surfaces. Several subdivision algorithms are constructed and investigated. Some graphic examples are also presented. Inspired by the Chaikin's algorithm and the Catmull-Clark's algorithm, some non-uniform schemes, the non-uniform corner cutting scheme and the recursive subdivision algorithm for non-uniform B-spline curves, are constructed and analysed. The adapted parametrization is introduced to analyse these non-uniform algorithms. In order to solve the surface interpolation problem, the Dyn-Gregory-Levin's 4-point interpolatory scheme is generalized to surfaces and the 10-point interpolatory subdivision scheme for surfaces is formulated. The so-called Butterfly Scheme, which was firstly introduced by Dyn, Gregory Levin in 1988, is just a special case of the scheme. By studying the Cross-Differences of Directional Divided Differences, a matrix approach for analysing uniform subdivision algorithms for surfaces is established and the convergence of the 10-point scheme over both uniform and non-uniform triangular networks is studied. Another algorithm, the subdivision algorithm for uniform bi-quartic B-spline surfaces over arbitrary topology is introduced and investigated. This algorithm is a generalization of Doo-Sabin's and Catmull-Clark's algorithms. It produces uniform Bi-quartic B-spline patches over uniform data. By studying the local subdivision matrix, which is a circulant, the tangent plane and curvature properties of the limit surfaces at the so-called Extraordinary Points are studied in detail.The Chinese Educational Commission and The British Council (SBFSS/1987

08221 Abstracts Collection -- Geometric Modeling

From May 26 to May 30 2008 the Dagstuhl Seminar 08221 ``Geometric Modeling\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available