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 16 of 16 for “"Delaunay graph"”.

  1. The Exact Spanning Ratio of the Parallelogram Delaunay Graph

    Finding the exact spanning ratio of a Delaunay graph has been one of the longstanding open problems in Computational Geometry. Currently there are only four convex shapes for which the exact spanning ratio of their Delaunay graph is known: the equilateral triangle, the square, the regular hexagon …

    ottawa-retro Repository record for The Exact Spanning Ratio of the Parallelogram Delaunay Graph (opens in a new tab)

  2. Voronoi diagrams of semi-algebraic sets

    … in the Voronoi zone it belongs to. The dual graph of the Voronoi diagram is called the Delaunay graph. Only approximations by conies can guarantee a proper order of continuity at contact points, which is necessary for guaranteeing the exactness of the Delaunay graph. The theoretical purpose …

    ubc Repository record for Voronoi diagrams of semi-algebraic sets (opens in a new tab) Download PDF for Voronoi diagrams of semi-algebraic sets (opens in a new tab)

  3. Υπολογιστική γεωμετρία για καμπύλα αντικείμενα: διαγράμματα Voronoi στο επίπεδο

    … we examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean plane, given in parametric form. Pseudo-circles are closed curves, every pair of which has at most two intersection …

    greece Repository record for Υπολογιστική γεωμετρία για καμπύλα αντικείμενα: διαγράμματα Voronoi στο επίπεδο (opens in a new tab)

  4. EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS

    … and develops two planarization algorithms for geographic routing and a geographic routing protocol for mobile ad hoc and sensor networks. As all nodes are mobile and there is no fixed infrastructure, the design of routing protocols is one of the most challenging issues in mobile ad hoc and sensor …

    uky-thes Repository record for EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS (opens in a new tab)

  5. A dynamic approach to area mapping in a geographic information system

    … to area mapping by investigating how a geographic information system can be utilized to create and manage areas. The main purpose of the report is to investigate how to create areas from user generated content and how to store and query the areas efficiently and correctly. The implemented …

    chalmers Repository record for A dynamic approach to area mapping in a geographic information system (opens in a new tab)

  6. Data Clustering and Graph-Based Image Matching Methods

    … describes our novel methods for data clustering, graph characterizing and image matching. In Chapter 3, our main contribution is the M1NN agglomerative clustering method with a new parallel merging algorithm. A cluster characterizing quantity is derived from the path-based dissimilarity measure. …

    whiterose Download PDF for Data Clustering and Graph-Based Image Matching Methods (opens in a new tab)

  7. Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms

    This thesis studies different generalizations of Delaunay triangulations, both from a combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S, denoted DT(S), has vertex set S. An edge uv is in DT(S) if it satisfies the empty circle property: there exists a circle …

    carleton Repository record for Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms (opens in a new tab)

  8. Theta-Graphs and Other Constrained Spanners

    … on the spanning ratio of various geometric graphs, one of which being θ-graphs. Given a set of points in the plane, a θ-graph partitions the plane around each vertex into m disjoint cones, each having aperture θ = 2π/m, and adds an edge to the `closest' vertex in each …

    carleton Repository record for Theta-Graphs and Other Constrained Spanners (opens in a new tab)

  9. Using Surface Sensitivity for Adjoint Aerodynamic Optimisation of Shock Control Bumps

    … calculating the surface sensitivity using the Delaunay Graph Mapping (DGM) mesh movement has been developed. This provides an explicit and efficient mapping of the mesh sensitivity to the surface senstivity. Previously, this required the solution of a large and costly linear system using a mesh …

    whiterose Download PDF for Using Surface Sensitivity for Adjoint Aerodynamic Optimisation of Shock Control Bumps (opens in a new tab)

  10. Equilibrium graphs on the flat torus or finding zen amidst the bull

    … spring embedding theorem, and equilibrium graphs on the plane in general, have been a subject of study for many decades, with connections to and applications in many areas, including, but not limited to, discrete geometry, planar graph theory, graphics, surface parametrization, mechanical …

    uiuc Repository record for Equilibrium graphs on the flat torus or finding zen amidst the bull (opens in a new tab)

  11. Convergent discretisation schemes for transition path theory for diffusion processes

    … a non-Markovian jump process on the associated Delaunay graph. To this process we associate the analogues of the committor function, isocommittor surfaces, the probability current and streamlines. These objects are the key objects in both TPT for diffusion processes and TPT for Markov jump …

    fu-berlin Repository record for Convergent discretisation schemes for transition path theory for diffusion processes (opens in a new tab)

  12. Efficiency Improvements to Adjoint-Based Aeroelastic Optimisations using a Trim-Corrected and Hybrid Mesh Deformation Strategy

    … on the convergence of the FSI simulation. The Delaunay Graph Mapping (DGM) mesh deformation algorithm is employed to obtain faster convergence of the coupled-adjoint than the RBF approach. To increase the efficiency of optimisation process, a hybrid mesh deformation strategy is proposed by …

    whiterose Download PDF for Efficiency Improvements to Adjoint-Based Aeroelastic Optimisations using a Trim-Corrected and Hybrid Mesh Deformation Strategy (opens in a new tab)

  13. Hybrid RANS-LES simulations for separated flows using dynamic grids

    … energy spectrum. Two and three dimensional Delaunay Graph based mesh deformation was incorporated in the respective two and three dimensional versions of the solver DG DES. Initial results from both 2D and 3D solvers are presented. NACA0033 with a flexible tail is simulated using the 2D …

    whiterose Download PDF for Hybrid RANS-LES simulations for separated flows using dynamic grids (opens in a new tab)

  14. Mesh Sensitivity Investigation in the Discrete Adjoint Framework

    … sensitivity. A novel method based on the DGM (Delaunay Graph Mapping) mesh movement is proposed to efficiently compute the grid sensitivity required in the discrete adjoint optimisation framework. The method makes use of a one-to-one explicit algebraic mapping between the volume mesh and the …

    whiterose Download PDF for Mesh Sensitivity Investigation in the Discrete Adjoint Framework (opens in a new tab)

  15. Identification of Team Tactical Formations and Player Positions in Association Football

    … labels. In Chapter 3, we introduce shape graphs as a fundamental structure to identify player tactical positions and derive team formations. Starting from the Delaunay Triangulation, the dual of the Voronoi diagram (a simple space control model), we first quantify their edge stability and …

    ethz Repository record for Identification of Team Tactical Formations and Player Positions in Association Football (opens in a new tab)

  16. Έλεγχος και βελτιστοποίηση λειτουργίας ασύρματα δικτυωμένων συστημάτων με έμφαση στην ποιότητα των παρεχόμενων υπηρεσιών

    The primary objective of the present PhD thesis is the analysis and the synthesis of mechanisms and algorithms that optimize the operation of Wireless Networked Systems. The term Wireless Networked Systems is used to describe the distributed systems, whose components are interconnected over …

    greece Repository record for Έλεγχος και βελτιστοποίηση λειτουργίας ασύρματα δικτυωμένων συστημάτων με έμφαση στην ποιότητα των παρεχόμενων υπηρεσιών (opens in a new tab)