Smooth parametric surfaces and n-sided patches

The theory of 'geometric continuity' within the subject of CAGD is reviewed. In particular, we are concerned with how parametric surface patches for CAGD can be pieced together to form a smooth Ck surface. The theory is applied to the problem of filling an n-sided hole occurring within a smooth rectangular patch complex. A number of solutions to this problem are surveyed

Arbitrary topology meshes in geometric design and vector graphics

Meshes are a powerful means to represent objects and shapes both in 2D and 3D, but the techniques based on meshes can only be used in certain regular settings and restrict their usage. Meshes with an arbitrary topology have many interesting applications in geometric design and (vector) graphics, and can give designers more freedom in designing complex objects. In the first part of the thesis we look at how these meshes can be used in computer aided design to represent objects that consist of multiple regular meshes that are constructed together. Then we extend the B-spline surface technique from the regular setting to work on extraordinary regions in meshes so that multisided B-spline patches are created. In addition, we show how to render multisided objects efficiently, through using the GPU and tessellation. In the second part of the thesis we look at how the gradient mesh vector graphics primitives can be combined with procedural noise functions to create expressive but sparsely defined vector graphic images. We also look at how the gradient mesh can be extended to arbitrary topology variants. Here, we compare existing work with two new formulations of a polygonal gradient mesh. Finally we show how we can turn any image into a vector graphics image in an efficient manner. This vectorisation process automatically extracts important image features and constructs a mesh around it. This automatic pipeline is very efficient and even facilitates interactive image vectorisation

Multivariate Splines and Algebraic Geometry

Multivariate splines are effective tools in numerical analysis and approximation theory. Despite an extensive literature on the subject, there remain open questions in finding their dimension, constructing local bases, and determining their approximation power. Much of what is currently known was developed by numerical analysts, using classical methods, in particular the so-called Bernstein-B´ezier techniques. Due to their many interesting structural properties, splines have become of keen interest to researchers in commutative and homological algebra and algebraic geometry. Unfortunately, these communities have not collaborated much. The purpose of the half-size workshop is to intensify the interaction between the different groups by bringing them together. This could lead to essential breakthroughs on several of the above problems

New strategies for curve and arbitrary-topology surface constructions for design

This dissertation presents some novel constructions for curves and surfaces with arbitrary topology in the context of geometric modeling. In particular, it deals mainly with three intimately connected topics that are of interest in both theoretical and applied research: subdivision surfaces, non-uniform local interpolation (in both univariate and bivariate cases), and spaces of generalized splines. Specifically, we describe a strategy for the integration of subdivision surfaces in computer-aided design systems and provide examples to show the effectiveness of its implementation. Moreover, we present a construction of locally supported, non-uniform, piecewise polynomial univariate interpolants of minimum degree with respect to other prescribed design parameters (such as support width, order of continuity and order of approximation). Still in the setting of non-uniform local interpolation, but in the case of surfaces, we devise a novel parameterization strategy that, together with a suitable patching technique, allows us to define composite surfaces that interpolate given arbitrary-topology meshes or curve networks and satisfy both requirements of regularity and aesthetic shape quality usually needed in the CAD modeling framework. Finally, in the context of generalized splines, we propose an approach for the construction of the optimal normalized totally positive (B-spline) basis, acknowledged as the best basis of representation for design purposes, as well as a numerical procedure for checking the existence of such a basis in a given generalized spline space. All the constructions presented here have been devised keeping in mind also the importance of application and implementation, and of the related requirements that numerical procedures must satisfy, in particular in the CAD context

Integration between Creativity and Engineering in Industrial Design

The objective of the paper is to illustrate which are the key issues today in the industrial design workflow, paying particular attention to the most creative part of the workflow, highlighting those nodes which still make hard the styling activities and giving a brief survey of the researches aimed at smoothing the transfer of the design intent along the whole design cycle and at providing tools even more adhering at the mentality of creative people. Based on the experience gained working in two different European projects, through the collaboration with industrial designers in the automotive and the household supplies fields, a general industrial design workflow will be depicted, highlighting the main differences between the automotive and non-automotive sectors; the problems still present in the design activity will be also illustrated. The paper includes short surveys, in relation to the aesthetic design, in matter of research activities aimed at - identifying the links between shape characteristics of a product and the transmitted emotions - better supporting, in a digital way, the 2D sketching phase and the automatic interpretation and transfer of the 2D sketches into a 3D surface model - improving the 3D Modeling phase

Non-linear subdivision of univariate signals and discrete surfaces

During the last 20 years, the joint expansion of computing power, computer graphics, networking capabilities and multiresolution analysis have stimulated several research domains, and developed the need for new types of data such as 3D models, i.e. discrete surfaces. In the intersection between multiresolution analysis and computer graphics, subdivision methods, i.e. iterative refinement procedures of curves or surfaces, have a non-negligible place, since they are a basic component needed to adapt existing multiresolution techniques dedicated to signals and images to more complicated data such as discrete surfaces represented by polygonal meshes. Such representations are of great interest since they make polygonal meshes nearly as exible as higher level 3D model representations, such as piecewise polynomial based surfaces (e.g. NURBS, B-splines...). The generalization of subdivision methods from univariate data to polygonal meshes is relatively simple in case of a regular mesh but becomes less straightforward when handling irregularities. Moreover, in the linear univariate case, obtaining a smoother limit curve is achieved by increasing the size of the support of the subdivision scheme, which is not a trivial operation in the case of a surface subdivision scheme without a priori assumptions on the mesh. While many linear subdivision methods are available, the studies concerning more general non-linear methods are relatively sparse, whereas such techniques could be used to achieve better results without increasing the size support. The goal of this study is to propose and to analyze a binary non-linear interpolatory subdivision method. The proposed technique uses local polar coordinates to compute the positions of the newly inserted points. It is shown that the method converges toward continuous limit functions. The proposed univariate scheme is extended to triangular meshes, possibly with boundaries. In order to evaluate characteristics of the proposed scheme which are not proved analytically, numerical estimates to study convergence, regularity of the limit function and approximation order are studied and validated using known linear schemes of identical support. The convergence criterion is adapted to surface subdivision via a Hausdorff distance-based metric. The evolution of Gaussian and mean curvature of limit surfaces is also studied and compared against theoretical values when available. An application of surface subdivision to build a multiresolution representation of 3D models is also studied. In particular, the efficiency of such a representation for compression and in terms of rate-distortion of such a representation is shown. An alternate to the initial SPIHT-based encoding, based on the JPEG 2000 image compression standard method. This method makes possible partial decoding of the compressed model in both SNR-progressive and level-progressive ways, while adding only a minimal overhead when compared to SPIHT

Computer-Aided Geometry Modeling

Techniques in computer-aided geometry modeling and their application are addressed. Mathematical modeling, solid geometry models, management of geometric data, development of geometry standards, and interactive and graphic procedures are discussed. The applications include aeronautical and aerospace structures design, fluid flow modeling, and gas turbine design

Smooth Subdivision Surfaces: Mesh Blending and Local Interpolation

Subdivision surfaces are widely used in computer graphics and animation. Catmull-Clark subdivision (CCS) is one of the most popular subdivision schemes. It is capable of modeling and representing complex shape of arbitrary topology. Polar surface, working on a triangle-quad mixed mesh structure, is proposed to solve the inherent ripple problem of Catmull-Clark subdivision surface (CCSS). CCSS is known to be C1 continuous at extraordinary points. In this work, we present a G2 scheme at CCS extraordinary points. The work is done by revising CCS subdivision step with Extraordinary-Points-Avoidance model together with mesh blending technique which selects guiding control points from a set of regular sub-meshes (named dominative control meshes) iteratively at each subdivision level. A similar mesh blending technique is applied to Polar extraordinary faces of Polar surface as well. Both CCS and Polar subdivision schemes are approximating. Traditionally, one can obtain a CCS limit surface to interpolate given data mesh by iteratively solving a global linear system. In this work, we present a universal interpolating scheme for all quad subdivision surfaces, called Bezier Crust. Bezier Crust is a specially selected bi-quintic Bezier surface patch. With Bezier Crust, one can obtain a high quality interpolating surface on CCSS by parametrically adding CCSS and Bezier Crust. We also show that with a triangle/quad conversion process one can apply Bezier Crust on Polar surfaces as well. We further show that Bezier Crust can be used to generate hollowed 3D objects for applications in rapid prototyping. An alternative interpolating approach specifically designed for CCSS is developed. This new scheme, called One-Step Bi-cubic Interpolation, uses bicubic patches only. With lower degree polynomial, this scheme is appropriate for interpolating large-scale data sets. In sum, this work presents our research on improving surface smoothness at extraordinary points of both CCS and Polar surfaces and present two local interpolating approaches on approximating subdivision schemes. All examples included in this work show that the results of our research works on subdivision surfaces are of high quality and appropriate for high precision engineering and graphics usage

Construction of C\u3csup\u3e∞\u3c/sup\u3e Surfaces From Triangular Meshes Using Parametric Pseudo-Manifolds

We present a new constructive solution for the problem of fitting a smooth surface to a given triangle mesh. Our construction is based on the manifold-based approach pioneered by Grimm and Hughes. The key idea behind this approach is to define a surface by overlapping surface patches via a gluing process, as opposed to stitching them together along their common boundary curves. The manifold based approach has proved to be well-suited to fit with relative ease, Ck-continuous parametric surfaces to triangle and quadrilateral meshes, for any arbitrary finite k or even k = ∞. Smooth surfaces generated by the manifold-based approach share some of the most important properties of splines surfaces, such as local shape control and fixed-sized local support for basis functions. In addition, the differential structure of a manifold provides us with a natural setting for solving equations on the surface boundary of 3D shapes. Our new manifold-based solution possesses most of the best features of previous constructions. In particular, our construction is simple, compact, powerful, and flexible in ways of defining the geometry of the resulting surface. Unlike some of the most recent manifold-based solutions, ours has been devised to work with triangle meshes. These meshes are far more popular than any other kind of mesh encountered in computer graphics and geometry processing applications. We also provide a mathematically sound theoretical framework to undergird our solution. This theoretical framework slightly improves upon the one given by Grimm and Hughes, which was used by most manifold-based constructions introduced before