Advanced search

Found 2 swedish dissertations matching the above criteria.

2. 1. 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

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