Spelling suggestions: "subject:"cooks"" "subject:"moons""
11 |
Constructing a diffeomorphism between a trimmed domain and the unit squareRandrianarivony, Maharavo, Brunnett, Guido, Schneider, Reinhold 31 August 2006 (has links)
This document has two objectives: decomposition of
a given trimmed surface into several four-sided
subregions and creation of a diffeomorphism from
the unit square onto each subregion. We aim at
having a diffeomorphism which is easy and fast to
evaluate. Throughout this paper one of our
objectives is to keep the shape of the curves
delineating the boundaries of the trimmed surfaces
unchanged. The approach that is used invokes the
use of transfinite interpolations. We will describe
an automatic manner to specify internal cubic
Bezier-spline curves that are to be subsequently
interpolated by a Gordon patch. Some theoretical
criterion pertaining to the control points of the
internal curves is proposed and proved so as to
ensure that the resulting Gordon patch is a
diffeomorphism. Numerical results are reported
to illustrate the approaches. Our benchmarks
include CAD objects which come directly from
IGES files.
|
12 |
The ITL programming interface toolkitRandrianarivony, Maharavo 27 February 2007 (has links)
This document serves as a reference for the beta version of our evaluation
library ITL. First, it describes a library which gives an easy way for
programmers to evaluate the 3D image and the normal vector corresponding to
a parameter value which belongs to the unit square. The API functions which
are described in this document let programmers make those
evaluations without the need to understand the underlying CAD complica-
tions. As a consequence, programmers can concentrate on their own scien-
tific interests. Our second objective is to describe the input which is a set
of parametric four-sided surfaces that have the structure required by some
integral equation solvers.
|
13 |
Geometric processing of CAD data and meshes as input of integral equation solversRandrianarivony, Maharavo 23 November 2006 (has links) (PDF)
Among the presently known numerical solvers of integral equations, two main
categories of approaches can be traced: mesh-free approaches, mesh-based approaches.
We will propose some techniques to process geometric data so that they can
be efficiently used in subsequent numerical treatments of integral equations. In
order to prepare geometric information so that the above two approaches can be
automatically applied, we need the following items:
(1) Splitting a given surface into several four-sided patches,
(2) Generating a diffeomorphism from the unit square to a foursided patch,
(3) Generating a mesh M on a given surface,
(4) Patching of a given triangulation.
In order to have a splitting, we need to approximate the surfaces
first by polygonal regions. We use afterwards quadrangulation techniques by
removing quadrilaterals repeatedly. We will generate the diffeomorphisms by
means of transfinite interpolations of Coons and Gordon types.
The generation of a mesh M from a piecewise Riemannian surface will use some
generalized Delaunay techniques in which the mesh size will be determined with
the help of the Laplace-Beltrami operator.
We will describe our experiences with the IGES format because of two reasons.
First, most of our implementations have been done with it. Next, some of the
proposed methodologies assume that the curve and surface representations are
similar to those of IGES.
Patching a mesh consists in approximating or interpolating it by a set of practical
surfaces such as B-spline patches. That approach proves useful when we want to
utilize a mesh-free integral equation solver but the input geometry is represented
as a mesh.
|
14 |
Geometric processing of CAD data and meshes as input of integral equation solversRandrianarivony, Maharavo 30 September 2006 (has links)
Among the presently known numerical solvers of integral equations, two main
categories of approaches can be traced: mesh-free approaches, mesh-based approaches.
We will propose some techniques to process geometric data so that they can
be efficiently used in subsequent numerical treatments of integral equations. In
order to prepare geometric information so that the above two approaches can be
automatically applied, we need the following items:
(1) Splitting a given surface into several four-sided patches,
(2) Generating a diffeomorphism from the unit square to a foursided patch,
(3) Generating a mesh M on a given surface,
(4) Patching of a given triangulation.
In order to have a splitting, we need to approximate the surfaces
first by polygonal regions. We use afterwards quadrangulation techniques by
removing quadrilaterals repeatedly. We will generate the diffeomorphisms by
means of transfinite interpolations of Coons and Gordon types.
The generation of a mesh M from a piecewise Riemannian surface will use some
generalized Delaunay techniques in which the mesh size will be determined with
the help of the Laplace-Beltrami operator.
We will describe our experiences with the IGES format because of two reasons.
First, most of our implementations have been done with it. Next, some of the
proposed methodologies assume that the curve and surface representations are
similar to those of IGES.
Patching a mesh consists in approximating or interpolating it by a set of practical
surfaces such as B-spline patches. That approach proves useful when we want to
utilize a mesh-free integral equation solver but the input geometry is represented
as a mesh.
|
15 |
Modelování NURBS křivek a ploch v projektivním prostoru / Modelling of NURBS curves and surfaces in the projective spaceOndroušková, Jana January 2009 (has links)
In the first part I discuss ancestors of NURBS curves and surfaces, rather Ferguson, Beziere, Coons and B-spline curves and surfaces and furthermore B-spline functions. In the second part I devote to NURBS curves and surfaces, their description as a linear combination of B-spline functions in the projective space. I specify conical arcs more detailed, their submit in the projective space and NURBS surfasec given as tensor product of NURBS curves. Last part is devote to describtion programs for modeling conicals and NURBS surface.
|
Page generated in 0.0445 seconds