Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 70 for “"geometric problems"”.

  1. Geometric Problems in Robot Exploration

    … such as these, new challenges are introduced. Problems that have been previously researched to be performed, either theoretically or implemented, need to be redesigned to be able to better handle these challenges. In this thesis, I will discuss multiple problems that have previously been …

    lsu-thes Repository record for Geometric Problems in Robot Exploration (opens in a new tab)

  2. Solving Geometric Problems in Space-Conscious Models

    … are studied, and the focus is on fundamental geometric problems, such as 2D convex hulls, 3D convex hulls, Voronoi diagrams and nearest neighbor queries, Klee's measure problem, and low-dimensional linear programming. In-place algorithms only use O(1) extra space besides the input array. We …

    waterloo Repository record for Solving Geometric Problems in Space-Conscious Models (opens in a new tab)

  3. Computational and communication complexity of geometric problems

    In this dissertation, we investigate a number of geometric problems in different settings. We present lower bounds and approximation algorithms for geometric problems in sequential and distributed settings. For the sequential setting, we prove the first hardness of approximation results for the …

    uvic Repository record for Computational and communication complexity of geometric problems (opens in a new tab)

  4. Semidefinite Relaxations for Geometric Problems in Robotics

    … in global convex optimization to two fundamental geometric problems in robotics: extrinsic sensor calibration and inverse kinematics in cluttered workspaces. We begin with a summary and extension of the semidefinite relaxation machinery that we apply to both problems. This machinery is used to …

    toronto-retro Repository record for Semidefinite Relaxations for Geometric Problems in Robotics (opens in a new tab)

  5. Geometric Problems in Measure Theory and Parametrizations

    This dissertation explores geometric measure theory; the first part explores a question posed by Paul Erdös -- Is there a number c > 0 such that if E is a Lebesgue measurable subset of the plane with λ²(E) (planar measure)> c, then E contains the vertices of a triangle with area equal to one? -- …

    unt Repository record for Geometric Problems in Measure Theory and Parametrizations (opens in a new tab)

  6. Efficient Algorithms for Graph-Theoretic and Geometric Problems

    This thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. The …

    lund Repository record for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab) Download PDF for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab)

  7. Analytic and geometric problems related to capillary hypersurfaces

    This thesis consists of two parts. The first part is devoted to studying the Alexandrov−Fenchel inequalities for capillary hypersurfaces supported on geodesic planes in Euclidean space $ℝⁿ⁺¹$ and hyperbolic space $ℍⁿ⁺¹$. we introduce a locally constrained mean curvature flow in $ℝⁿ⁺¹$ and a locally …

    freiburg-diss Repository record for Analytic and geometric problems related to capillary hypersurfaces (opens in a new tab)

  8. Some variational and geometric problems on metric measure spaces

    In this Thesis, we analyze three variational and geometric problems, that extend classical Euclidean issues of the calculus of variations to more general classes of spaces. The results we outline are based on the articles [Ved21; MV21] and on a forthcoming joint work with Nicolussi Golo and Serra …

    trento Repository record for Some variational and geometric problems on metric measure spaces (opens in a new tab)

  9. Algorithms and hardness results for geometric problems on stochastic datasets

    Traditionally, geometric problems are studied on datasets in which each data object exists with probability 1 at its location in the underlying space. However, in many scenarios, there may be some uncertainty associated with the existence or the locations of the data points. Such uncertain …

    umn Repository record for Algorithms and hardness results for geometric problems on stochastic datasets (opens in a new tab)

  10. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks

    … thesis, we study and solve several fundamental geometric problems in order to provide solutions to these problems. The key underlying technique for solving such geometric problems is solving systems of polynomial equations. In this thesis, several general techniques are developed. We utilize …

    lund Repository record for Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks (opens in a new tab) Download PDF for Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks (opens in a new tab)

  11. Closest Point Geometry Processing: Extensions and Applications of the Closest Point Method for Geometric Problems in Computer Graphics

    This thesis develops theoretical aspects and numerical methods for solving partial differential equations (PDEs) posed on any object for which closest point queries can be evaluated. In geometry processing (and computer graphics in general), objects are represented on a computer in many different …

    waterloo Repository record for Closest Point Geometry Processing: Extensions and Applications of the Closest Point Method for Geometric Problems in Computer Graphics (opens in a new tab)

  12. An exploratory study of the spatial visualization abilities and problem solving processes exhibited by High School mathematics students while solving a set of geometric problems

    … ability to comprehend relationships and to solve problems in a three-dimensional context, should be a primary objective of mathematics instruction. Sound information about effective ways to develop and to evaluate spatial visualization ability is lacking. The processes utilized by students in …

    utk-theses Repository record for An exploratory study of the spatial visualization abilities and problem solving processes exhibited by High School mathematics students while solving a set of geometric problems (opens in a new tab)

  13. Parallel algorithms for convex hulls and proximity problems

    … with the algorithmic aspects of solving geometric problems. The problems are motivated from and have application to such diverse areas as computer graphics, robotics, computer vision, and operations research. Problems arising from these areas of application are good candidates for …

    uiuc Repository record for Parallel algorithms for convex hulls and proximity problems (opens in a new tab)

  14. The method of fundamental solutions for Helmholtz-type problems

    … solutions (MFS) to solve direct and inverse geometric problems associated with two- or three-dimensional Helmholtz-type equations. Inverse problems have become more and more important in various fields of sicence and technology, and have certainly been one of the fastest growing areas in …

    whiterose Download PDF for The method of fundamental solutions for Helmholtz-type problems (opens in a new tab)

Page 1 of 4