Search for dissertations about: "data triangulation"

Showing result 1 - 5 of 79 swedish dissertations containing the words data 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. Approximation Algorithms for Geometric Networks

    Author : Mattias Andersson; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; control; systems; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap;

    Abstract : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. READ MORE

  5. 3. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Author : Magdalene Grantson Borgelt; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Abstract : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. READ MORE

  6. 4. 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

  7. 5. 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