Sökning: "triangulations"

Visar resultat 1 - 5 av 10 avhandlingar innehållade ordet triangulations.

1. 1. Characterisations of function spaces on fractals

   Författare :Mats Bodin; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; function spaces; wavelets; bases; fractals; triangulations; iterated function systems; MATHEMATICS; MATEMATIK;

   Sammanfattning : This thesis consists of three papers, all of them on the topic of function spaces on fractals.The papers summarised in this thesis are:Paper I Mats Bodin, Wavelets and function spaces on Mauldin-Williams fractals, Research Report in Mathematics No. 7, Umeå University, 2005. LÄS MER

3. 2. Geometric Decompositions and Networks - Approximation Bounds and Algorithms

   Författare :Joachim Gudmundsson; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; kontroll; system; Delaunay triangulation; Computational geometry; TSP with neighborhoods; geometric spanners; covering polygons; Computer science; numerical analysis; systems; control; numerisk analys; Datalogi; algebraisk topologi; algebraic topology; Geometry; Data- och systemvetenskap; Geometri;

   Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER

4. 3. New results about the approximation behavior of the greedy triangulation

   Författare :Christos Levcopoulos; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : In this paper it is shown that there is some constant c, such that for any polygon, with or without holes, with w concave vertices, the length of any greedy triangulation of the polygon is not longer than c x (w + 1) times the length of a minimum weight triangulation of the polygon (under the assumption that no three vertices lie on the same line). A low approximation constant is proved for interesting classes of polygons. LÄS MER

5. 4. Advancing Front Mesh Generation Techniques with Application to the Finite Element Method

   Författare :Jan Frykestig; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; advancing front method; mesh size distribution; automatic mesh generation; finite element method; surface mesh generation; spatial data structures;

   Sammanfattning : The present study deals with automatic mesh generation with application to finite element methods. We focus our interest on unstructured mesh generation, and in particular on advancing front methods for which algorithms for meshing of two and three dimensional domains as well as of free-form surfaces are devised. LÄS MER

7. 5. Computational Characterization of Mixing in Flows

   Författare :Erik D. Svensson; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; mixing; hyperbolicity; shadowing; finite elements; flow simulation; a priori error estimates; Stokes equations; point location; multigrid; refinements; mixing;

   Sammanfattning : The major theme of this thesis is mathematical aspects of fluid mixing in the case when diffusion is negligible, which is commonly refered to as ’mixing by stirring’ or ’mixing by chaotic advection’ in the engineering literature. In this case the mixing is driven by a velocity field and is characterized by the flow generated by the velocity field. LÄS MER