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 27 for “"Voronoi Diagram"”.

  1. The inverse problem to the Voronoi diagram

    … problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a solution to the Inverse Problem it was necessary …

    twu Repository record for The inverse problem to the Voronoi diagram (opens in a new tab)

  2. Shortest secure path in a Voronoi Diagram

    … of computing the shortest secure path in a Voronoi diagram. Here, a path is secure if it is a sequence of touching Voronoi cells, where each Voronoi cell in the path has a uniform cost of being secured. Importantly, we allow inserting new sites, which in some cases leads to significantly …

    uiuc Repository record for Shortest secure path in a Voronoi Diagram (opens in a new tab)

  3. Modelling Three-dimensional Fields in Geoscience with the Voronoi Diagram and its Dual

    … I propose using a new spatial model based the Voronoi diagram (VD) and its dual the Delaunay tetrahedralization (DT). I argue that constructing the VD/DT of the samples that were collected to study the field can be beneficial for extracting meaningful information from it. Firstly, the …

    southwales Repository record for Modelling Three-dimensional Fields in Geoscience with the Voronoi Diagram and its Dual (opens in a new tab)

  4. A compact piecewise-linear Voronoi diagram for convex sites in the plane, or, Simple paths in a complex world

    … are both classically solved by computing a Voronoi diagram. When the sites are k disjoint convex sets, we give a compact representation of the Voronoi diagram, using 0(k) line segments, that is sufficient for logarithmic time post-office location queries and motion planning. If these sets …

    ubc Repository record for A compact piecewise-linear Voronoi diagram for convex sites in the plane, or, Simple paths in a complex world (opens in a new tab)

  5. Fast and exact geodesic computation using Edge-based Windows Grouping.

    … employed to construct the geodesic-metric-based Voronoi diagram on triangle meshes. In this application, the geodesic computation is the bottleneck in both the time and memory costs. The proposed method achieves low memory cost from the key observation that the Voronoi diagram boundaries usually …

    bournemouth Repository record for Fast and exact geodesic computation using Edge-based Windows Grouping. (opens in a new tab)

  6. Clustering Response-Stressor Relationships in Ecological Studies

    … in ecological studies. The second approach is a Voronoi diagram based partition approach. This approach uses the Voronoi diagram technique to randomly partition the whole region into subregions with predetermined minimum sample size. The optimal partition/cluster is selected by Monte Carlo …

    vt Repository record for Clustering Response-Stressor Relationships in Ecological Studies (opens in a new tab)

  7. Medial surface transformations for rapid approximation of casting solidification

    … a convex faceted model by computing the model's Voronoi diagram and uses it to identify casting hot spots and cooling patterns. Comparison with a finite difference method (FDM) solution showed that the locations and shapes of hot spots predicted by FDM converge to the shapes and locations …

    vt Repository record for Medial surface transformations for rapid approximation of casting solidification (opens in a new tab)

  8. Approximation algorithms for multi-facility location

    … NP-hard; For locating multiple facilities we use Voronoi diagram of initial facility locations to partition the customer sites into k clusters. On each Voronoi region, solutions for single facility problem is obtained by using both Weizfield's algorithm and Center of Gravity. The customer space is …

    unlv Repository record for Approximation algorithms for multi-facility location (opens in a new tab)

  9. Mesh generation using a correspondence distance field

    … automatically. Second, the boundaries in a Voronoi diagram between specified coordinates are detected adaptively and used to make Delaunay tessellation. Tessellation of regions with holes is performed using ghost nodes. Images of meshed for each method are given for a sample set of test …

    utc Repository record for Mesh generation using a correspondence distance field (opens in a new tab)

  10. Design of platforms for computing context with spatio-temporal locality

    … on how to create a platform based on cells of a Voronoi diagram for optimizing the energy and bandwidth required for mobiles to exchange contextual information t hat is tied to specific locations in the platform. Additionally, we applied our results to the problem of optimizing a system for …

    texas Repository record for Design of platforms for computing context with spatio-temporal locality (opens in a new tab)

  11. Comparison of path-planning and search methods for cooperating unmanned aerial vehicles

    … leads to the lowest cost solution, while the Voronoi diagram method provides a computationally inexpensive solution.;The second scenario is a search and destroy mission where nothing is known about the battlefield prior to UAVs launch. This will consist of the vehicles visiting a set of …

    wvu Repository record for Comparison of path-planning and search methods for cooperating unmanned aerial vehicles (opens in a new tab)

  12. Road sign recognition

    … algorithm in calculating the distance using Voronoi diagram based on edge map as point set is developed.

    concordia Repository record for Road sign recognition (opens in a new tab)

  13. Analyzing Crime on Street Networks: A Comparison of Network and Euclidean Voronoi Methods

    … to use either Euclidean or network distance. Voronoi diagrams which can be implemented utilizing either Euclidean distance or network distance (distance measured along a street) offer a means for performing this comparison. Utilizing Voronoi diagram implementations with Euclidean distance and …

    uiuc Repository record for Analyzing Crime on Street Networks: A Comparison of Network and Euclidean Voronoi Methods (opens in a new tab)

  14. Patterns of Optimal Structural Layouts

    … using transformations of the Delaunay mesh and Voronoi diagram is presented, and certain Euclidean tilings are presented as optimal beam layouts.

    mit Repository record for Patterns of Optimal Structural Layouts (opens in a new tab)

  15. Computational geometry through the information lens

    … asked in SODA'92 for a o(nlg n) algorithm for Voronoi diagrams. Despite growing interest in the problem, it was not successfully solved until this thesis. Formally, let w be the number of bits in a computer word, and consider n points with O(w)-bit rational coordinates. This thesis describes: * …

    mit Repository record for Computational geometry through the information lens (opens in a new tab)

  16. Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    … planning methods such as Visibility Graph (VG), Voronoi Diagram (VD), Potential Fields (PF) and Rapidly-Exploring Random Tree (RRT). Among those, VG is superior in terms of producing a path with the least length and completeness. However, VG has a drawback due to the fact that its computation …

    uthm Repository record for Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method (opens in a new tab)

  17. Cooperative Collision Avoidance for the Voyager Unmanned Ground Vehicle: Practical Implementation and Demonstration

    … an optimal route through a roadmap made of the Voronoi diagram of the map. The local planners of cooperative agents take a decentralised approach, broadcasting short-term predictions of their future positions to each other over a shared communication channel. If an agent detects a conflict …

    stellenbosch Repository record for Cooperative Collision Avoidance for the Voyager Unmanned Ground Vehicle: Practical Implementation and Demonstration (opens in a new tab)

  18. Multi-visualization and hybrid segmentation approaches within telemedicine framework

    … operator; the second step divides the image by Voronoi Diagram and reclassifies the regions by the operator to refine segmentation from the previous step; the third step handles vague boundary by level set model. Topics for future research are mentioned in the end, including new supplement for …

    potsdam-diss Repository record for Multi-visualization and hybrid segmentation approaches within telemedicine framework (opens in a new tab)

  19. Enhancing Hex-dominant Meshes: Generation, Evaluation, and Simplification

    … information for feature alignment and utilizes a Voronoi diagram for geometry representation, which enables the pipeline to excel in both global and local controllability. The extraction strategy significantly improves generation performance. Second, I introduced a new 3D hexahedral mesh visual …

    houston Repository record for Enhancing Hex-dominant Meshes: Generation, Evaluation, and Simplification (opens in a new tab)

  20. Hot tearing and constitutive behaviour of semi-solid aluminum alloys

    … model based on a geometry derived from a Voronoi diagram with rounded corners and porosity. Numerical techniques were utilized to quantify both the size evolution and orientation of internal damage relative to void growth. In order to conduct the above research, a new semi-solid tensile …

    ubc Repository record for Hot tearing and constitutive behaviour of semi-solid aluminum alloys (opens in a new tab)

Page 1 of 2