Sökning: "Voronoi diagram"

Hittade 3 avhandlingar innehållade orden Voronoi diagram.

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

    Detta är en avhandling från Division of Machine Design, Department of Design Sciences, Faculty of Engineering LTH, Lund University

    Författare :Axel Nordin; [2012]
    Nyckelord :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

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

    Detta är en avhandling från Division of Machine Design, Department of Design Sciences, Faculty of Engineering LTH, Lund University

    Författare :Edvin Åblad; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Voronoi diagram; vehicle routing; Smart Assembly 4.0; motion planning; mathematical modelling; decomposition; continuous collision detection; set packing; automotive manufacturing; 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

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

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Mikael Hammar; [2001]
    Nyckelord :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