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

A survey of partial differential equations in geometric design

YesComputer aided geometric design is an area where the improvement of surface generation techniques is an everlasting demand since faster and more accurate geometric models are required. Traditional methods for generating surfaces were initially mainly based upon interpolation algorithms. Recently, partial differential equations (PDE) were introduced as a valuable tool for geometric modelling since they offer a number of features from which these areas can benefit. This work summarises the uses given to PDE surfaces as a surface generation technique togethe

Aircraft geometry verification with enhanced computer generated displays

A method for visual verification of aerodynamic geometries using computer generated, color shaded images is described. The mathematical models representing aircraft geometries are created for use in theoretical aerodynamic analyses and in computer aided manufacturing. The aerodynamic shapes are defined using parametric bi-cubic splined patches. This mathematical representation is then used as input to an algorithm that generates a color shaded image of the geometry. A discussion of the techniques used in the mathematical representation of the geometry and in the rendering of the color shaded display is presented. The results include examples of color shaded displays, which are contrasted with wire frame type displays. The examples also show the use of mapped surface pressures in terms of color shaded images of V/STOL fighter/attack aircraft and advanced turboprop aircraft

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

PARABOLIC BLENDING SURFACES ALONG POLYHEDRON EDGES

In this paper parabolic blending surfaces are defined along a chain of polyhedron edges. The profile curve of each sweep surface generated for a given edge is a conic section, and every point of it moves on a conic section around a vertex. According to this, the patches at the corners are given in rational biquadratic form and they join to the cylindrical surfaces replacing the edges with 1st order continuity

Fast generation of 3D deformable moving surfaces

Dynamic surface modeling is an important subject of geometric modeling due to their extensive applications in engineering design, entertainment and medical visualization. Many deformable objects in the real world are dynamic objects as their shapes change over time. Traditional geometric modeling methods are mainly concerned with static problems, therefore unsuitable for the representation of dynamic objects. Apart from the definition of a dynamic modeling problem, another key issue is how to solve the problem. Because of the complexity of the representations, currently the finite element method or finite difference method is usually used. Their major shortcoming is the excessive computational cost, hence not ideal for applications requiring real-time performance. We propose a representation of dynamic surface modeling with a set of fourth order dynamic partial differential equations (PDEs). To solve these dynamic PDEs accurately and efficiently, we also develop an effective resolution method. This method is further extended to achieve local deformation and produce n-sided patches. It is demonstrated that this new method is almost as fast and accurate as the analytical closed form resolution method and much more efficient and accurate than the numerical methods

Intersection of three-dimensional geometric surfaces

Calculating the line of intersection between two three-dimensional objects and using the information to generate a third object is a key element in a geometry development system. Techniques are presented for the generation of three-dimensional objects, the calculation of a line of intersection between two objects, and the construction of a resultant third object. The objects are closed surfaces consisting of adjacent bicubic parametric patches using Bezier basis functions. The intersection determination involves subdividing the patches that make up the objects until they are approximately planar and then calculating the intersection between planes. The resulting straight-line segments are connected to form the curve of intersection. The polygons in the neighborhood of the intersection are reconstructed and put back into the Bezier representation. A third object can be generated using various combinations of the original two. Several examples are presented. Special cases and problems were encountered, and the method for handling them is discussed. The special cases and problems included intersection of patch edges, gaps between adjacent patches because of unequal subdivision, holes, or islands within patches, and computer round-off error