Sökning: "polygon"

Visar resultat 1 - 5 av 29 avhandlingar innehållade ordet polygon.

  1. 1. Fitting Polygons to Coordinate Data

    Författare :Anna Persson; Lennart Bondesson; Umeå universitet; []
    Nyckelord :area; EM algorithm; iteratively reweighted least squares; order restrictions; polygon; polyhedron; restricted least squares; simulation; volume;

    Sammanfattning : .... LÄS MER

  3. 2. Numerical Conformal mappings for regions Bounded by Smooth Curves

    Författare :Anders Andersson; Börje Nilsson; Joachim Toft; Michael Benedicks; Växjö universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Schwarz-Christoffel mapping; rounded corners; tangent polygons; outer polygon; zipper algorithm; Schwarz-Christoffelavbildningen; rundade hörn; tangentpolygoner; yttre polygoner; zipper-algoritmer; Applied mathematics; Tillämpad matematik; Mathematics; Matematik;

    Sammanfattning : Inom många tillämpningar används konforma avbildningar för att transformera tvådimensionella områden till områden med enklare utseende. Ett exempel på ett sådant område är en kanal av varierande tjocklek begränsad av en kontinuerligt deriverbar kurva. LÄS MER

  4. 3. Numerical Conformal Mappings for Regions Bounded by Smooth Curves

    Författare :Anders Andersson; Jönköping University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Schwarz–Christoffel mapping; rounded corners; tangent polygons; outer polygon; zipper algorithm; Applied mathematics; Tillämpad matematik; Numerical analysis; Numerisk analys;

    Sammanfattning : In many applications, conformal mappings are used to transform twodimensional regions into simpler ones. One such region for which conformal mappings are needed is a channel bounded by continuously differentiable curves. LÄS MER

  5. 4. Applications in Monocular Computer Vision using Geometry and Learning : Map Merging, 3D Reconstruction and Detection of Geometric Primitives

    Författare :David Gillsjö; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Scene Completion; Deep Learning; Bayesian Neural Network; Room Layout Estimation; Line Segment Detection; Polygon Detection; Graph Neural Network; Map Merging; Structure from Motion; Minimal Solvers; Wireframe Estimation;

    Sammanfattning : As the dream of autonomous vehicles moving around in our world comes closer, the problem of robust localization and mapping is essential to solve. In this inherently structured and geometric problem we also want the agents to learn from experience in a data driven fashion. LÄS MER

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

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