Sökning: "vertex"

Visar resultat 1 - 5 av 95 uppsatser innehållade ordet vertex.

  1. 1. Analysis of Mutable Game Environments Built on a Tetrahedral Mesh : Tetras, a Potential Alternative to Voxels

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

    Författare :Noah Tell; [2023]
    Nyckelord :Voxels; Tetrahedron; Tetrahedral Mesh; Tetrahedralization; Tessellation; Mutable Environment; Editable Terrain; Deformable Environment; Boolean Operations; Real-Time; Computer Games; Computational Geometry; Voxlar; Tetrahedror; Tetrahedralisering; Tessellering; Formbar Terräng; Booliska Operationer; Realtid; Datorspel; Beräkningsgeometri;

    Sammanfattning : Historically 3D game environments have almost always been immutable. Mutable environments are a technical challenge that will affect performance. For games of the future to continue approaching realism, mutable environments are an essential step. LÄS MER

  3. 2. Low-No code Platforms for Predictive Analytics

    Magister-uppsats, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Soma Karmakar; [2023]
    Nyckelord :Low code; no code; Predictive analytics; databricks; azure; AWS; Google cloud;

    Sammanfattning : In the data-driven landscape of modern business, predictive analytics plays a pivotal role inanticipating and mitigating customer churn—a critical challenge for organizations. However, thetraditional complexities of machine learning hinder accessibility for decision-makers. LÄS MER

  4. 3. Distance Consistent Labellings and the Local List Number

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Anders Henricsson; [2023]
    Nyckelord :distance-consistence; graph labelling; graph distance; avstånds-konsistens; grafmärkning; grafavstånd;

    Sammanfattning : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). LÄS MER

  5. 4. Hybrid Simulations of Solar Wind Plasma Interaction with the Lunar Reiner Gamma Magnetic Anomaly

    Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysik

    Författare :David Frisk Strömberg; [2023]
    Nyckelord :;

    Sammanfattning : The Moon has small scale regions of strong magnetic fields scattered over its surface, known as crustal fields. Coexisting with some of the strongest crustal fields are peculiar markings in the lunar soil, called lunar swirls, which are suggested to be formed by magnetosphere-like interactions between the crustal fields and the solar wind plasma. LÄS MER

  7. 5. Cache behaviour analysis for graph algorithms

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Johan Söderström; [2023]
    Nyckelord :;

    Sammanfattning : Graph processing is an ever-increasing significant area of research in the wake of the demand for efficient tools that process data such as graphs, which can describe sets of objects (vertices) and their relations to each other (edges). Graph algorithms traverse these graphs by visiting their vertices or additionally calculating some properties about them such as how significant a specific vertex is in the context of the greater graph. LÄS MER