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 13 of 13 for “"closest point method"”.

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

    … 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 ways. …

    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)

  2. Nonlinear diffusion filtering on surfaces

    Nonlinear diffusion filtering is a PDE-based method to remove noise from images that has found much success. This dissertation looks at whether nonlinear diffusion filtering can be combined with the closest point method, a relatively new and novel method for solving partial differential equations …

    oxford Repository record for Nonlinear diffusion filtering on surfaces (opens in a new tab)

  3. Solving reachable sets on a manifold

    … explores the implementation of the fast marching method as part of the toolbox of level set methods. This method uses Dijkstra's algorithm to approximate the solution to the non-linear Eikonal equation. Functions for calculating signed distances and extension velocities are also implemented. These …

    ubc Repository record for Solving reachable sets on a manifold (opens in a new tab) Download PDF for Solving reachable sets on a manifold (opens in a new tab)

  4. Closest point methods with polyharmonic spline radial basis functions and local refinement

    Closest point methods are a class of embedding methods that have been used to solve partial differential equations on surfaces with the closest point representation of the surface. Recently, several studies replaced the standard Cartesian grid methods in the original Closest point methods with …

    ubc Repository record for Closest point methods with polyharmonic spline radial basis functions and local refinement (opens in a new tab) Download PDF for Closest point methods with polyharmonic spline radial basis functions and local refinement (opens in a new tab)

  5. A closest point penalty method for evolution equations on surfaces

    … thesis introduces and analyses a numerical method for solving time-dependent partial differential equations (PDEs) on surfaces. This method is based on the closest point method, and solves the surface PDE by solving a suitably chosen equation in a band surrounding the surface. As it uses an …

    oxford Repository record for A closest point penalty method for evolution equations on surfaces (opens in a new tab)

  6. Frequency-domain range data registration for three-dimensional space modeling in robotic applications

    The registration method presented in this thesis does not require an initial estimation of the transformation, and avoids problems of the classical iterative techniques by employing the multi-dimensional Fourier transform, which decouples the estimation of rotational parameters from the estimation …

    ottawa-retro Repository record for Frequency-domain range data registration for three-dimensional space modeling in robotic applications (opens in a new tab)

  7. Mesh-free Methods for the Adaptive Discretization and High-order Approximation of Dynamic Surfaces

    In the past decades, mesh-free particle methods have advanced steadily and amassed a rich body of literature. They have successfully demonstrated their ability to simulate complex physics in various fields of research ranging from applied engineering to biology. Remarkably, the mesh-free …

    qucosa-diss

  8. Geometric multigrid and closest point methods for surfaces and general domains

    … analytical and practical aspects of applying the Closest Point Method to solve elliptic partial differential equations (PDEs) on smooth surfaces and domains with smooth boundaries. A new numerical scheme is proposed to solve surface elliptic PDEs and a novel geometric multigrid solver is …

    oxford Repository record for Geometric multigrid and closest point methods for surfaces and general domains (opens in a new tab)

  9. Topics in the asymptotic analysis of narrow escape and quorum-sensing behavior for PDE models with biological applications

    … aspect ratio. We develop an embedded numerical method for both stationary and periodic mobile trap problems, based on the Closest Point Method (CPM), to perform MFPT simulations on various confining 2-D domains. Optimal trap arrangements are identified numerically through either a refined …

    ubc Repository record for Topics in the asymptotic analysis of narrow escape and quorum-sensing behavior for PDE models with biological applications (opens in a new tab) Download PDF for Topics in the asymptotic analysis of narrow escape and quorum-sensing behavior for PDE models with biological applications (opens in a new tab)

  10. Landslide deformation character inferred from terrestrial laser scanner data

    … information is challenging. Three dimensional point-cloud data from terrestrial laser scanning (TLS) show potential for obtaining ground displacements accurately. Problems arise, however, when estimating continuous displacement fields from TLS data because reflecting points from sequential …

    hawaii Repository record for Landslide deformation character inferred from terrestrial laser scanner data (opens in a new tab)

  11. Toward General-Purpose Monte Carlo PDE Solvers for Graphics Applications

    This thesis develops novel Monte Carlo methods for solving a wide range of partial differential equations (PDEs) relevant to computer graphics. While traditional discretization-based approaches efficiently compute global solutions, they often require expensive global solves even when only local …

    waterloo Repository record for Toward General-Purpose Monte Carlo PDE Solvers for Graphics Applications (opens in a new tab)

  12. Systems and Methods for Multiple-View and Depth-Based People Tracking and Human-Computer Interaction

    This thesis presents systems and methods for real-time multiple-view and depth-based optical tracking for specific human-computer interaction and smart environment applications. Multiple-view systems are used for mitigating occlusions, enhancing tracking precision and accuracy, and extending the …

    aalto Repository record for Systems and Methods for Multiple-View and Depth-Based People Tracking and Human-Computer Interaction (opens in a new tab)

  13. Modeling the Effect of Cell Shape on GTPase Signaling in Neurons

    … for Chapter 2 where we implement a computational method to simulate reaction and diffusion on curved surfaces representing the cell membrane coupled with reaction and diffusion in the enclosed volume (representing the cell cytosol). To solve the reaction-diffusion equations on the surface we use …

    duke Repository record for Modeling the Effect of Cell Shape on GTPase Signaling in Neurons (opens in a new tab)