Sökning: "geometric data analysis"

Visar resultat 11 - 15 av 97 avhandlingar innehållade orden geometric data analysis.

  1. 11. Tame representations in Topological Data Analysis: decompositions, invariants and metrics

    Författare :Francesca Tombari; Wojciech Chachólski; Patrizio Frosini; Peter Bubenik; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; topological data analysis; tameness; decompositions; invariants; metrics; Matematik; Mathematics;

    Sammanfattning : This thesis is a compilation of results that can be framed within the field of applied topology. The starting point of our study is objects presenting a possibly complex intrinsic geometry. The main goal is then to simplify, without trivializing, the geometric information characterising these objects by choosing an appropriate representation. LÄS MER

  3. 12. Complex Cavity Analysis : Analytical Fluid-Power Models Using CAD Information

    Författare :Magnus Sethson; Richard T. Burton; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : This thesis covers different methods of topology search for making time-domain simulation models based on geometric information. The application is in the field of fluid-power. Automatic methods for extracting simulation models from CAD data are presented. LÄS MER

  4. 13. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Författare :Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

    Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER

  5. 14. 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

  7. 15. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Författare :Magdalene Grantson Borgelt; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Sammanfattning : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. LÄS MER