107 research outputs found

    Flexible G1 Interpolation of Quad Meshes

    Get PDF
    International audienceTransforming an arbitrary mesh into a smooth G1 surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G1-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces

    Smooth Subdivision Surfaces: Mesh Blending and Local Interpolation

    Get PDF
    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

    Subdivision Surface based One-Piece Representation

    Get PDF
    Subdivision surfaces are capable of modeling and representing complex shapes of arbi-trary topology. However, methods on how to build the control mesh of a complex surfaceare not studied much. Currently, most meshes of complicated objects come from trian-gulation and simplification of raster scanned data points, like the Stanford 3D ScanningRepository. This approach is costly and leads to very dense meshes.Subdivision surface based one-piece representation means to represent the final objectin a design process with only one subdivision surface, no matter how complicated theobject\u27s topology or shape. Hence the number of parts in the final representation isalways one.In this dissertation we present necessary mathematical theories and geometric algo-rithms to support subdivision surface based one-piece representation. First, an explicitparametrization method is presented for exact evaluation of Catmull-Clark subdivisionsurfaces. Based on it, two approaches are proposed for constructing the one-piece rep-resentation of a given object with arbitrary topology. One approach is to construct theone-piece representation by using the interpolation technique. Interpolation is a naturalway to build models, but the fairness of the interpolating surface is a big concern inprevious methods. With similarity based interpolation technique, we can obtain bet-ter modeling results with less undesired artifacts and undulations. Another approachis through performing Boolean operations. Up to this point, accurate Boolean oper-ations over subdivision surfaces are not approached yet in the literature. We presenta robust and error controllable Boolean operation method which results in a one-piecerepresentation. Because one-piece representations resulting from the above two methodsare usually dense, error controllable simplification of one-piece representations is needed.Two methods are presented for this purpose: adaptive tessellation and multiresolutionanalysis. Both methods can significantly reduce the complexity of a one-piece represen-tation and while having accurate error estimation.A system that performs subdivision surface based one-piece representation was im-plemented and a lot of examples have been tested. All the examples show that our ap-proaches can obtain very good subdivision based one-piece representation results. Eventhough our methods are based on Catmull-Clark subdivision scheme, we believe they canbe adapted to other subdivision schemes as well with small modifications

    Integration between Creativity and Engineering in Industrial Design

    Get PDF
    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

    Practical quality control tools for curves and surfaces

    Get PDF
    Curves (geometry) and surfaces created by Computer Aided Geometric Design systems in the engineering environment must satisfy two basic quality criteria: the geometric shape must have the desired engineering properties; and the objects must be parameterized in a way which does not cause computational difficulty for geometric processing and engineering analysis. Interactive techniques are described which are in use at Boeing to evaluate the quality of aircraft geometry prior to Computational Fluid Dynamic analysis, including newly developed methods for examining surface parameterization and its effects

    Polynomial-based non-uniform interpolatory subdivision with features control

    Get PDF
    Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform refinement with the advantages of a shape-controlled interpolation method and an arbitrary point insertion rule. The result is a non-uniform interpolatory 4-point scheme that is unique in combining a number of distinctive properties. In fact it generates visually-pleasing limit curves where special features ranging from cusps and flat edges to point/edge tension effects may be included without creating undesired undulations. Moreover such a scheme is capable of inserting new points at any positions of existing intervals, so that the most convenient parameter values may be chosen as well as the intervals for insertion. Such a fully flexible curve scheme is a fundamental step towards the construction of high-quality interpolatory subdivision surfaces with features control

    Feasible Form Parameter Design of Complex Ship Hull Form Geometry

    Get PDF
    This thesis introduces a new methodology for robust form parameter design of complex hull form geometry via constraint programming, automatic differentiation, interval arithmetic, and truncated hierarchical B- splines. To date, there has been no clearly stated methodology for assuring consistency of general (equality and inequality) constraints across an entire geometric form parameter ship hull design space. In contrast, the method to be given here can be used to produce guaranteed narrowing of the design space, such that infeasible portions are eliminated. Furthermore, we can guarantee that any set of form parameters generated by our method will be self consistent. It is for this reason that we use the title feasible form parameter design. In form parameter design, a design space is represented by a tuple of design parameters which are extended in each design space dimension. In this representation, a single feasible design is a consistent set of real valued parameters, one for every component of the design space tuple. Using the methodology to be given here, we pick out designs which consist of consistent parameters, narrowed to any desired precision up to that of the machine, even for equality constraints. Furthermore, the method is developed to enable the generation of complex hull forms using an extension of the basic rules idea to allow for automated generation of rules networks, plus the use of the truncated hierarchical B-splines, a wavelet-adaptive extension of standard B-splines and hierarchical B-splines. The adaptive resolution methods are employed in order to allow an automated program the freedom to generate complex B-spline representations of the geometry in a robust manner across multiple levels of detail. Thus two complementary objectives are pursued: ensuring feasible starting sets of form parameters, and enabling the generation of complex hull form geometry

    Data-dependent fairing of subdivision surfaces

    Get PDF
    In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to subdivision surface fairing encountered problems with singularities in the parametrization of the surface. We address these issues through the use of the characteristic map parametrization, leading to well defined membrane and bending energies even at irregular vertices. Combining this approach with ideas from data-dependent energy operators we are able to express the associated nonlinear stiffness matrices for Catmull-Clark surfaces as linear combinations of precomputed energy matrices. This machinery also provides exact, inexpensive gradients and Hessians of the new energy operators. With these the nonlinear minimization problem can be solved in a stable and efficient way using Steihaug's Newton/CG trust-region method. We compare properties of linear and nonlinear methods through a number of examples and report on the performance of the algorithm

    Data-dependent fairing of subdivision surfaces

    Full text link
    • …
    corecore