Sökning: "Voronoi diagram"

Hittade 5 avhandlingar innehållade orden Voronoi diagram.

  1. 1. Voronoi-Based Coding

    Författare :Erik Agrell; Chalmers University of Technology; []
    Nyckelord :Voronoi diagram; linear block code; Gaussian channel; neighbor descent; nearest neighbor search algorithm; computational geometry; asymptotic theory; source coding; lattice; vector quantization; soft-decision decoding; index assignment; channel coding; complexity;

    Sammanfattning : The performance of a digital communication system can generally be improved by increasing the number of variables being jointly coded. In this sense, it is desirable to have, e.g., higher-dimensional quantizers, longer channel codes, and more users in a multiple-access system. LÄS MER

  2. 2. Transforming and Strengthening the Links Between Industrial Design, Engineering Design and Production

    Författare :Axel Nordin; Produktutveckling; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; mechanical engineering design; industrial design; customization; optimization; Morphological repertoire; constraint handling; production; genetic algorithm; voronoi diagram; Renaissance 2.0;

    Sammanfattning : The current form-giving activity in industrial design is characterized by explorations that depend on the individual capability to mentally manipulate a solution space from which to select and express the intended result. Designers often rely on artistic experimentation, aesthetic inspiration, or product specifications. LÄS MER

  3. 3. Mathematical Modelling and Methods for Load Balancing and Coordination of Multi-Robot Stations

    Författare :Edvin Åblad; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; Smart Assembly 4.0; automotive manufacturing; set packing; motion planning; mathematical modelling; vehicle routing; continuous collision detection; decomposition; Voronoi diagram; makespan minimization;

    Sammanfattning : The automotive industry is moving from mass production towards an individualized production, individualizing parts aims to improve product quality and to reduce costs and material waste. This thesis concerns aspects of load balancing and coordination of multi-robot stations in the automotive manufacturing industry, considering efficient algorithms required by an individualized production. LÄS MER

  4. 4. Mathematical Modelling for Load Balancing and Minimization of Coordination Losses in Multirobot Stations

    Författare :Edvin Åblad; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; decomposition; mathematical modelling; Voronoi diagram; set packing; automotive manufacturing; Smart Assembly 4.0; continuous collision detection; motion planning; vehicle routing; makespan minimization;

    Sammanfattning : The automotive industry is moving from mass production towards an individualized production, in order to improve product quality and reduce costs and material waste. This thesis concerns aspects of load balancing of industrial robots in the automotive manufacturing industry, considering efficient algorithms required by an individualized production. LÄS MER

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

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; 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;

    Sammanfattning : 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. LÄS MER