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 73 for “"computational geometry"”.
-
Topics in Computational Geometry
Computational geometry is the branch of complexity theory that deals with geometrical problems, and has received much attention in recent years. Presented here are analyses of algorithms and complexity results for certain geometrical problems.
-
Topics in combinatorial and computational geometry
… of two parts dealing with combinatorial and computational problems in geometry, respectively. In the first part three independent problems are considered: (1) We determine an upper bound $\lfloor 11n/6\rfloor$ + 1 for the number of extreme triples of n points in the plane, almost matching a …
-
Computational geometry through the information lens
This thesis revisits classic problems in computational geometry from the modern algorithmic perspective of exploiting the bounded precision of the input. In one dimension, this viewpoint has taken over as the standard model of computation, and has led to a powerful suite of techniques that …
-
Applications of Computational Geometry and Computer Vision
… field of computer vision. Within the domains of computational geometry and computer vision are two problems: Finding large, interesting holes in high dimensional data, and locating and automatically classifying facial features from images. State of the art methods for facial feature …
-
Simple and practical algorithms in computational geometry
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms
-
Problems and Results in Discrete and Computational Geometry
Let S be a set of n points in R^3 , no three collinear and not all coplanar. Ifat most n - k are coplanar and n is sufficiently large, the total number ofplanes determined is at least 1 + k * binom(n-k,2) - ((n-k)/2) * binom(k, 2). For similar conditions and sufficiently large n, (inspired by the …
-
In pursuit of linear complexity in discrete and computational geometry
Many computational problems arise naturally from geometric data. In this thesis, we consider three such problems: (i) distance optimization problems over point sets, (ii) computing contour trees over simplicial meshes, and (iii) bounding the expected complexity of weighted Voronoi diagrams. While …
-
Fast Parallel Algorithms and Library for Spatial Clustering and Computational Geometry
… solving large-scale spatial clustering and computational geometry problems. The primary focus is on designing theoretically-efficient and practical algorithms that can handle the increasing demand for faster processing speeds in spatial data sets. In the first part of the thesis, we …
-
Effective Density Visualization of Multiple Overlapping Axis-Aligned Objects
… axis-aligned objects is a challenging computational geometry problem that can inform several applications and services, in diverse domains. The primary focus of this research is, given many axis-aligned objects, to devise efficient and effective data visualization methods that inform …
-
Geometric Probing
… mathematical optimization, integral and computational geometry, graph theory, and other areas fit into this paradigm.
-
Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.
… work presents the solution to three problems in Computational Geometry. First we introduce a theorem to illuminate every triangle with three p6 vertex-floodlights and we provide three proofs. Secondly we show that three p4 vertex-floodlights suffice to illuminate every quadrilateral. Finally we …
-
Complexity of Minimum Corridor Guarding Problems
… problems are proved to be NP-complete. Keywords: computational complexity, computational geometry, corridor guarding, NP-complete"
-
Parallel algorithms for convex hulls and proximity problems
Computational geometry is concerned 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 …
-
Competitive Algorithms and System for Multi-Robot Exploration of Unknown Environments
… information-theoretic exploration algorithms and computational geometry based exploration algorithms. The algorithm is based on a single-robot polygon exploration algorithm and a tree exploration algorithm. We show that the exploration time of our algorithm is competitive (as a function of p) with …
-
Toward Controllable and Robust Surface Reconstruction from Spatial Curves
… a fundamental problem in computer graphics and computational geometry. It often arises in many applications across various disciplines, such as industrial prototyping, artistic design and biomedical imaging. While the problem has been widely studied for years, challenges remain for handling …
-
Time-Optimal Algorithms on Meshes With Multiple Broadcasting
… a natural choice for solving a large number of computational tasks in image processing, computational geometry, and computer vision. However, due to its large communication diameter, the mesh tends to be slow when it comes to handling data transfer operations over long distances. In an attempt …
-
Mixed-Initiative tool to speed Up content creation in physics-based games
… games. Our system uses exhaustive search and computational geometry to allow the game designer to focus on the creative process of content creation by not needing to worry about the manual construction of the game structures. We use a clone of Angry Birds called Science Birds as testbed for …
Page 1 of 4