Principal Patches for Computational Geometry
نویسنده
چکیده
This thesis presents a new class of surface patches for the creation of sculptured surfaces in mechanical engineering applications of computer aided design. Ideas from differential geometry are used to create principal patches whose edges are lines of curvature. This is done by ensuring that the sides obey two equations called the frame matching and position matching conditions. It is shown that these conditions are both sufficie~t and necessary to create a patch based on lines of curvature. A solution to the frame matching equation is given for all cases where the patch boundaries are plane curves. Continuity between principal patches is examined. The method is illustrated by means of two well understood surface types which are of engineering importance: generalised cylinders and surfaces of revolution. The method is then used to create patches whose lines of curvature are circular arcs. Such patches come from surfaces known as Dupin's cyclides. These patches are demoostra ted to have one degree of freedom, assuming two sides of the patch are known, and a discussion of how to use this choice is given. Means of finding points in the patch interior are given. It is shown that cycl ide patches are a subset of rational biquadratic patches, and that the sphere, torus, cone, cylinder and plane are special cases. Another useful property is that the offset surface to a cyclide is another cyclide. The need for non four sided regions of surface is examined. These occur at umbilics when using principal patches. The behaviour of surfaces near umbilics is reviewed, and suggestions are made for dealing with such regions using principal patches. Some ideas for future work are recorded.
منابع مشابه
Principal Patches -a New Class of Surface Patch Based on Differential Geometry
This paper describes a new class of surface patch for use in computational geometry, where fairness is built in at the design stage by using ideas from differential geometry. Principal patches are patches whose sides are lines of curvature, and can be created by making the boundary curves obey two conditions called the frame and position matching equations. lt is shown that surface continuity i...
متن کاملLocal and Global Approaches to Fracture Mechanics Using Isogeometric Analysis Method
The present research investigates the implementations of different computational geometry technologies in isogeometric analysis framework for computational fracture mechanics. NURBS and T-splines are two different computational geometry technologies which are studied in this work. Among the features of B-spline basis functions, the possibility of enhancing a B-spline basis with discontinuities ...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملImage denoising using locally learned dictionaries
In this paper we discuss a novel patch-based framework for image denoising through local geometric representations of an image. We learn local data adaptive bases that best capture the underlying geometric information from noisy image patches. To do so we first identify regions of similar structure in the given image and group them together. This is done by the use of meaningful features in the...
متن کاملComputationally fast Bayesian recognition of complex objects based on mutual algebraic invariants
OBJECTS BASED ON MUTUAL ALGEBRAIC INVARIANTS Zhibin Lei, Daniel Keren, and David Cooper Division of Engineering, Brown University Providence, RI 02912 ABSTRACT An e ective approach has appeared in the literature for recognizing 2D curve or 3D surface objects of modest complexity based on representing an object by a single implicit polynomial of 3rd or 4th degree, computing a vector of Euclidean...
متن کامل