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 74 for “"Geometry processing"”.
-
Geometry Processing with Neural Fields
Geometry processing consists of algorithms for shape creation, manipulation, and analysis. These algorithms are cornerstones for the creation of almost every digital shapes. These shapes are consumed in our everyday lives, from digital contents to manufactured objects. These algorithms are …
-
Learning to optimize for geometry processing
Geometry processing, which focuses on reconstructing and analyzing physical objects and scenes, enjoy a wide range of applications, including medical diagnosis, architecture, bio-imaging, virtual reality, etc. Thanks to the popularity of portable 3D scanning devices and the emergence of big 3D data …
-
Machine Learning Algorithms for Geometry Processing by Example
… thesis proposes machine learning algorithms for processing geometry by example. Each algorithm takes as input a collection of shapes along with exemplar values of target properties related to shape processing tasks. The goal of the algorithms is to output a function that maps from the shape data …
-
Detail-driven Geometry Processing Pipeline using Neural Networks
Geometry processing is an established field in computer graphics, covering a variety of topics that embody decades-long research. However, with the pressing demand of reality digitization arising in recent years, classic geometry processing solutions are confronted with new challenges. For almost …
-
Orthogonally Constrained Sparse Approximations with Applications to Geometry Processing
… $X^TMX=I$. Such functions can be used in geometry processing as a basis for the function space of a mesh and are related to the Laplacian eigenfunctions. Compressed manifold modes and other alternatives to the Laplacian eigenfunctions are all special cases of generalised manifold …
-
Closest Point Geometry Processing: Extensions and Applications of the Closest Point Method for Geometric Problems in Computer Graphics
… 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. Requiring only closest point queries allows the methods we develop to be used with nearly any representation. Objects can be …
-
Integrable symmetric fields in computational design : from stable woven shells to seamless parameterizations
… in computer graphics, particularly in areas like geometry processing and computational fabrication, leverage a general toolkit that can be conceptualized as leveraging energy driven pattern formation to solve inverse problems. A large class of such problems ultimately involve minimizing an energy …
-
Differential geometry based representations for meshes and correspondences
… among these objects, which benefit subsequent geometry processing, modeling, and scientific computing.-- From abstract.
-
Spectral processing and optimization of static and dynamic 3D geometry
Geometry processing of 3D objects is of primary interest in many areas of computer vision and graphics, including robot navigation, 3D object recognition, classification, feature extraction, etc. The recent introduction of low cost range sensors has created a great interest in many new areas, …
-
Differential Filtering and Detexturing
… visual data plays an important role in image and geometry processing. Surfaces obtained through a scanning process or other reconstruction algorithms are inevitably noisy due to error in the scanning process and resampling of the data at various processing steps. These surfaces need to be denoised …
-
A framework for a successful additive repair system
… in preparatory steps such as 2D and 3D geometry processing, parameter estimation, and path planning as well as on-machine execution of the path plan. The bulk of the effort is focused on directed energy deposition techniques (DED), however many of the concepts are also applicable to …
-
Discretization and approximation of the shape operator, the Laplace-Beltrami operator, and the Willmore energy of surfaces
… energies. In addition, we consider a problem in geometry processing: the fairing of polyhedral surfaces. We develop a scheme for fairing under spatial constraints.
-
Fatigue optimization of an induction hardened shaft under combined loading
… and lifetime. Through systematic variation of geometry, processing, and loading parameters, performance surfaces are generated from which optimum case depths for maximizing shaft fatigue performance are determined. General implications of such procedures to the product development process are …
-
Discrete optimization problems in geometric mesh processing
Many geometry processing tasks in computer graphics reduce geometric problems to numerical optimization problems by minimizing an energy that captures the geometric properties we seek. These methods often encounter challenges in the presence of complex global geometric constraints that cannot be …
-
Feature-Preserving Neural Surface Reconstruction Using the Dirichlet Energy of the Gauss Map
Geometry acquisition from the real world is a fundamental but unsolved problem in computer graphics. With the evolution of sensors and new demands from modern applications, classical solutions are confronted with new challenges such as increased data volume and the necessity for real-time …
-
Functional Maps on Continuous Surfaces
Shape matching is a fundamental problem in geometry processing, computer vision, and computational anatomy. The functional map framework addresses this problem by representing correspondences between shapes as linear operators acting on spaces of functions, rather than as direct point-to-point …
-
A hybrid approach to problems in image processing
Digital image processing generally refers to the use of computer algorithms that deal with operations on or analysis of digital images. It covers a wide range of intriguing sub-topics. While these topics may vary from pattern recognition, classification to synthesis and generation, most techniques …
-
Computational solution and analysis of disentanglement puzzles
… fail to solve disentanglement puzzles, and no geometry processing tools have been designed for the analysis and design of disentanglement puzzles. Mathematically the disentanglement puzzles can be represented with their corresponding Configuration Space, or C-Space. This concept is widely used …
-
Parallel Algorithms for Rendering Large 3D Models on a Graphics Cluster
… at least two different programs on the graphics processing unit (GPU): a vertex shader program for vertex (geometry) processing, and a fragment shader program for pixel (colour) processing. With fragment shader programs becoming more and more time consuming, distributing load solely based on …
Page 1 of 4