Search for dissertations about: "Delaunay Triangulation"

Found 5 swedish dissertations containing the words Delaunay Triangulation.

  2. 1. Progress in Hierarchical Clustering & Minimum Weight Triangulation

    Author : Drago Krznaric; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; minimum spanning tree; complete linkage; hierarchical clustering; minimum weight triangulation; greedy triangulation; Data- och systemvetenskap;

    Abstract : In this thesis we study efficient computational methods for geometrical problems of practical importance and theoretical interest. The problems that we consider are primarily complete linkage clustering, minimum spanning trees, and approximating minimum weight triangulation. Below is a list of the main results proved in the thesis. READ MORE

  4. 2. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Author : Mikael Hammar; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Abstract : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. READ MORE

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

    Author : Joachim Gudmundsson; Institutionen för datavetenskap; []
    Keywords : 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;

    Abstract : 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. READ MORE

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

    Author : Jan Frykestig; Chalmers tekniska högskola; []
    Keywords : 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;

    Abstract : 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. READ MORE

  7. 5. Geometry linking the art of building and the Universe: Geometric patterns on shells and grid shells

    Author : Emil Adiels; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; HUMANIORA; HUMANITIES; HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; Form finding; Differential Geometry; Conceptual design; Geometry; Shell; Engineering; Masonry; Craftsmanship; Grid shell; Architecture; Structural design;

    Abstract : Geometry links the art of building and the physics of space-time. Mathematical breakthroughs in geometry have led to new ways of designing our structures and our ability to visualise and describe the world, phenomena in nature and the universe. READ MORE