Approximating tensor product Bézier surfaces with tangent plane continuity

AbstractWe present a simple method for degree reduction of tensor product Bézier surfaces with tangent plane continuity in L2-norm. Continuity constraints at the four corners of surfaces are considered, so that the boundary curves preserve endpoints continuity of any order α. We obtain matrix representations for the control points of the degree reduced surfaces by the least-squares method. A simple optimization scheme that minimizes the perturbations of some related control points is proposed, and the surface patches after adjustment are C∞ continuous in the interior and G1 continuous at the common boundaries. We show that this scheme is applicable to surface patches defined on chessboard-like domains

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

Conversion of B-rep CAD models into globally G¹ triangular splines

Existing techniques that convert B-rep (boundary representation) patches into Clough-Tocher splines guarantee watertight, that is C0, conversion results across B-rep edges. In contrast, our approach ensures global tangent-plane, that is G1, continuity of the converted B-rep CAD models. We achieve this by careful boundary curve and normal vector management, and by converting the input models into Shirman-Séquin macro-elements near their (trimmed) B-rep edges. We propose several different variants and compare them with respect to their locality, visual quality, and difference with the input B-rep CAD model. Although the same global G1 continuity can also be achieved by conversion techniques based on subdivision surfaces, our approach uses triangular splines and thus enjoys full compatibility with CAD

Gn blending multiple surfaces in polar coordinates

International audienceThis paper proposes a method of Gn blending multiple parametric surfaces in polar coordinates. It models the geometric continuity conditions of parametric surfaces in polar coordinates and presents a mechanism of converting a Cartesian parametric surface into its polar coordinate form. The basic idea is first to reparameterize the parametric blendees into the form of polar coordinates. Then they are blended simultaneously by a basis function in the complex domain. To extend its compatibility, we also propose a method of converting polar coordinate blending surface into N NURBS patches. One application of this technique is to fill N-sided holes. Examples are presented to show its feasibility and practicability

A novel parallel algorithm for surface editing and its FPGA implementation

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Doctor of PhilosophySurface modelling and editing is one of important subjects in computer graphics. Decades of research in computer graphics has been carried out on both low-level, hardware-related algorithms and high-level, abstract software. Success of computer graphics has been seen in many application areas, such as multimedia, visualisation, virtual reality and the Internet. However, the hardware realisation of OpenGL architecture based on FPGA (field programmable gate array) is beyond the scope of most of computer graphics researches. It is an uncultivated research area where the OpenGL pipeline, from hardware through the whole embedded system (ES) up to applications, is implemented in an FPGA chip. This research proposes a hybrid approach to investigating both software and hardware methods. It aims at bridging the gap between methods of software and hardware, and enhancing the overall performance for computer graphics. It consists of four parts, the construction of an FPGA-based ES, Mesa-OpenGL implementation for FPGA-based ESs, parallel processing, and a novel algorithm for surface modelling and editing. The FPGA-based ES is built up. In addition to the Nios II soft processor and DDR SDRAM memory, it consists of the LCD display device, frame buffers, video pipeline, and algorithm-specified module to support the graphics processing. Since there is no implementation of OpenGL ES available for FPGA-based ESs, a specific OpenGL implementation based on Mesa is carried out. Because of the limited FPGA resources, the implementation adopts the fixed-point arithmetic, which can offer faster computing and lower storage than the floating point arithmetic, and the accuracy satisfying the needs of 3D rendering. Moreover, the implementation includes Bézier-spline curve and surface algorithms to support surface modelling and editing. The pipelined parallelism and co-processors are used to accelerate graphics processing in this research. These two parallelism methods extend the traditional computation parallelism in fine-grained parallel tasks in the FPGA-base ESs. The novel algorithm for surface modelling and editing, called Progressive and Mixing Algorithm (PAMA), is proposed and implemented on FPGA-based ES’s. Compared with two main surface editing methods, subdivision and deformation, the PAMA can eliminate the large storage requirement and computing cost of intermediated processes. With four independent shape parameters, the PAMA can be used to model and edit freely the shape of an open or closed surface that keeps globally the zero-order geometric continuity. The PAMA can be applied independently not only FPGA-based ESs but also other platforms. With the parallel processing, small size, and low costs of computing, storage and power, the FPGA-based ES provides an effective hybrid solution to surface modelling and editing

Bézier surfaces with prescribed diagonals

The affine space of all tensor product Bézier patches of degree n × n with prescribed main diagonal curves is determined. First, the pair of Bézier curves which can be diagonals of a Bézier patch is characterized. Besides prescribing the diagonal curves, other related problems are considered, those where boundary curves or tangent planes along boundary curves are also prescribed.Funding for open access charge: CRUE-Universitat Jaume

G1 Range Restricted Data Interpolation Using Bézier Triangular Patch

Pembinaan permukaan berparameter G 1 julat terhad kepada data yang semua terletak di sebelah satu satah kekangan dipertimbangkan. Permukaan interpolasi dibina secara cebis demi cebis daripada gabungan cembung tiga tampalan segi tiga Bézier kuartik. Syarat cukup untuk keselanjaran satah tangen sepanjang sempadan dua tampalan Bézier kuartik dibentangkan. The construction of range restricted G 1 parametric surface to data that all lie on one side of a constraint plane is considered. The interpolating surface is developed piecewise as the convex combination of three quartic Bézier triangular patches. Sufficient tangent plane continuity conditions along the common boundary of two adjacent quartic Bézier triangular patches are presented

Constrained Interpolation And Shape Preserving Approximation By Space Curves [QA297.6. K82 2006 f rb].

Dua jenis masalah rekabentuk lengkung telah ipertimbangkan. Terlebih dahulu kami mempertimbangkan interpolasi satu set titik data ruang yang bertertib dengan satu lengkung licin tertakluk kepada satu set satah kekangan yang berbentuk terhingga atau tak terhingga di mana garis cebis demi cebis yang menyambung titik data secara berturutan tidak bersilang dengan satah kekangan. Two types of curve designing problem have been considered. We first consider the interpolation of a given set of ordered spatial data points by a smooth curve in the presence of a set of finite or infinite constraint planes, where the polyline joining consecutive data points does not intersect with the constraint planes

Filling polygonal holes with bicubic patches

Consider a bicubic rectangular patch complex which surrounds an n-sided hole in R3. Then the problem of filling the hole with n bicubic rectangular patches is studied

New rotation-free finite element shell triangle accurately using geometrical data

A new triangle shell element is presented. The advantages of this element are threefold: simplicity, generality and geometrical accuracy. The formulation is free from rotation degrees of freedom. The triangle here presented can be used regardless of the mesh topology, thus generality is conserved for any meshrepresented surface. From an original first order approach we evolve to a third order geometric description. The higher degree geometric description is based on the Bézier triangles concept, a very well known geometry in the domain of CAGD [G. Farin, Curves and Surfaces for CAGD. A Practical Guide, fifth ed., Morgan Kaufmann Publishers, San Francisco, CA, 2002]. Using this concept we show the path to reconstruct a general third order interpolating surface using only the three coordinates at each node. This work takes as starting point the nodal implementation of a basic triangle shell element [E. Oñate, F. Zárate, Rotation-free triangular plate and shell elements, Int. J. Numer. Methods Engrg. 47 (2000) 557– 603]. In order to use an exact formula for the curvature, the normal directions at each node and the way to characterize them are proposed. Then, the geometrical properties and the mechanical behavior of the surface created are introduced. Finally, different examples are presented to depict the versatility and accuracy of the element