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 383 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.
-
AGENT-BASED COMPUTATIONAL GEOMETRY
… library contains several applications solving computational geometry problems using ABM algorithms. This research aims to build additional four ABM algorithm-based applications: (1) range search, (2) point location, (3) largest empty circle, and (4) Euclidean shortest path. This research …
-
Dynamic problems in computational geometry
Computational geometry is the study of algorithms for manipulating sets of points, lines, polygons, planes and other geometric objects. For many problems in this realm, the sets considered are static and the data structures representing them do not permit efficient insertion and deletion of objects …
-
Computational geometry in string compactifications
Connecting string theory to low-energy particle physics necessitates the computation of physical Yukawa couplings, and thereby fermion masses, from string compactifications. Actually performing these calculations explicitly, however, presents significant challenges. The primary obstacles lie in …
-
Computational Geometry and Online Algorithms
This thesis explores several problems in computational geometry and online algorithms, focusing on efficient algorithms for geometric optimization and real-time decision-making. We begin by addressing the offline computational geometry problem of the Maximum Weighted Convex Polytope (MWCP), …
-
Computational Geometry in Computer-Aided Design
No abstract prepared.
-
Computational geometry on an integer grid
In this thesis we study a number of geometric problems in an integer grid domain. The worst case time complexity of many of the algorithms that solve geometric problems in the real plane is O(nlogn). This lower time bound is often proved by comparing the problems to Ω(nlogn) time comparison …
-
Computational geometry algorithms for visibility problems
This thesis examines algorithmic problems involving k-crossing visibility. Given two points p and q and a set of polygonal obstacles in the plane, where p and q are in general position relative to the vertices of the obstacles, p and q are k -crossing visible to each other if and only if the line …
-
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 …
-
Discrete Geometric Path Analysis in Computational Geometry
In this thesis, first, we study the weighted region problem (WRP), which is to compute a geometric shortest path on a weighted partitioning of a plane. Recent results show that WRP is not solvable in any algebraic computation model over rational numbers. Thus, scientists have focused on approximate …
-
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 …
-
Agent Based Parallelization of Computational Geometry Algorithms
… and extend the applicability of the library to a computationally complex problem area – computational geometry. We have developed agent based algorithms for four problems in this area – Closest pair of points, Voronoi diagram, Convex hull, and Delaunay triangulation, which is a maiden effort using …
-
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
-
SOLVING COMPUTATIONAL GEOMETRY PROBLEMS ON MESH-CONNECTED COMPUTERS
Parallel algorithms to solve several computational geometric problems on mesh-connected computers (MCC's) and systolic arrays are designed and analyzed. We present parallel MCC algorithms to solve the following proximity problems. Given a set of n planar points represented by their Cartesian …
-
Computational Geometry in the Funk and Hilbert Metrics
… of the Cayley-Klein model of hyperbolic geometry to arbitrary convex bodies. It has applications in convex approximation, quantum information theory, machine learning, and real analysis. The Hilbert metric can be constructed as the average of the forward Funk and reverse Funk metrics, …
-
A Computational Geometry Approach to Digital Image Contour Extraction
… from digital images, using techniques from computational geometry. Our approach is different from traditional pixel-based methods in image processing. Instead of working directly with pixels, we extract a set of oriented feature points from the input digital images, then apply classical …
-
The computational geometry of hydrology data in geographic information systems
Computational geometry counts geographic information systems (GIS) among its application areas. GIS data sets are large and are related to the Earth's surface by geometric coordinates. These properties mesh with geometry algorithms and their asymptotic analyses. This dissertation investigates the …
Page 1 of 20