Sökning: "layout algorithm"

Visar resultat 1 - 5 av 50 uppsatser innehållade orden layout algorithm.

  1. 1. Improvement of anautomatic networkdrawing algorithm in thecontext of utility networks

    Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

    Författare :Hyacinthe Ménard; [2024]
    Nyckelord :District Heating Network; Mathematical Optimization; Python; Fjärrvärme; Optimeringslära; Python;

    Sammanfattning : The European Union’s ambitious climate targets necessitate substantial reductions in greenhouse gas emissions, particularly within the heating and cooling sector, which accounts for a significant portion of energy consumption. District Heating and Cooling (DHC) systems emerge as a key solution for decarbonizing this sector by enabling high efficiency heat production and the integration of renewable and carbon-neutral energy sources. LÄS MER

  3. 2. Exploring the aesthetical qualities of scaled game maps through Human-AI Collaboration

    M1-uppsats, Malmö universitet/Fakulteten för teknik och samhälle (TS)

    Författare :Petter Rignell; Christian Sjösvärd; [2023]
    Nyckelord :game design; scale; scalability; aesthetics; AI; Human-AI Collaboration; MAP-Elites; EDD;

    Sammanfattning : The primary objective is to explore the scalability of two-dimensional game maps while preserving certain aesthetical qualities in scaled representations. By either upscaling or downscaling the maps, features of the map inducing these aesthetical qualities may diminish. LÄS MER

  4. 3. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Emmy Yin; [2023]
    Nyckelord :Dynamic Graphs; Graph Layout Algorithms; Visualization; Hierarchical Graph Layouts; Dynamiska grafer; grafritningsalgoritmer; visualisering; hierarkiska grafritningar;

    Sammanfattning : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. LÄS MER

  5. 4. Optimering av timmerplanslogistik : Minimering av transportavstånd för den nya timmerplanen på Sävar såg

    Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för matematik och matematisk statistik

    Författare :Linnea Asp; Elvira Carstedt; [2022]
    Nyckelord :sawmill; timber logistics; optimization; assignment problem; transportation distance; log yard layout; sågverk; timmerlogistik; optimering; tillordningsproblemet; transportavstånd; timmerplansdesign;

    Sammanfattning : An increase in demand for sawed wood products is the reason why Norra Timber has to expand their facility at Sävar Sawmill. During the expansion, a new log sorting will be implemented which can sort timber with different characteristics and qualities compared to the current log sorting. LÄS MER

  7. 5. Procedural System for Urban Forest Generation : Image-based Natural Terrain Generation

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Bosen Cheng; [2022]
    Nyckelord :datauppsättningar; neurala nätverk; blickdetektering; texttaggning;

    Sammanfattning : Procedural content generation is a common way to create model resources in the computer graphics area. It is beneficial for generating large-scale models such as buildings, forests, etc. This project focus on the generation of the urban forest, which is a case often overlooked. LÄS MER