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 115 for “"voronoi"”.

  1. THE LOW-INTENSITY LIMIT OF BERNOULLI-VORONOI AND POISSON-VORONOI MEASURES

    On a graph G the Bernoulli-Voronoi measure is an edge percolation process obtained as a result of the following procedure; first select vertices by a Bernoulli site percolation,with intensity p, as nuclei for a Voronoi tessellation and then delete edges whose end vertices lie in different Voronoi

    iu Repository record for THE LOW-INTENSITY LIMIT OF BERNOULLI-VORONOI AND POISSON-VORONOI MEASURES (opens in a new tab)

  2. Applications of Voronoi partitions in particle therapy

    … non-negative least squares. (2) We found that Voronoi partitions can provide effective heuristic solutions to the energy modulation change reduction and LET painting problems. In addition, this thesis also identified an array of important and challenging computational problems that are not only …

    unm Repository record for Applications of Voronoi partitions in particle therapy (opens in a new tab)

  3. 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)

  4. 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)

  5. Finite element analysis of Voronoi cellular solids

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Materials Science and Engineering, 1999.

    mit Repository record for Finite element analysis of Voronoi cellular solids (opens in a new tab)

  6. Multiple particle tracking in PEPT using Voronoi tessellations

    … presented which makes use of three-dimensional Voronoi tessellations to track up to 20 tracers using a PET scanner. The lines of response generated by the PET scanner are discretized into sets of equidistant points, and these are used as the input seeds to the Voronoi tessellation. For each line …

    cape-town Repository record for Multiple particle tracking in PEPT using Voronoi tessellations (opens in a new tab)

  7. A practical search with Voronoi distributed autonomous marine swarms

    … these threats. This thesis provides various Voronoi partition-based methods to autonomously control a swarm of identically capable autonomous surface vessels in a limited coverage and tracking problem. These methods increase the probability of interdiction of an adversary vehicle crossing a …

    woods-hole Repository record for A practical search with Voronoi distributed autonomous marine swarms (opens in a new tab)

  8. Over-Relaxation Lloyd Method For Computing Centroidal Voronoi Tessellations

    <p>Centrodial Voronoi tessellation (CVT) is a Voronoi tessellation of a region whose generating points are also the mass centroids of the corresponding Voronoi regions. Centrodial Voronoi tessellations have diverse applications in many areas of science and engineering. In this paper, we study …

    south-carolina Repository record for Over-Relaxation Lloyd Method For Computing Centroidal Voronoi Tessellations (opens in a new tab)

  9. A Practical Search with Voronoi Distributed Autonomous Marine Swarms

    … these threats. This thesis provides various Voronoi partition-based methods to autonomously control a swarm of identically capable autonomous surface vessels in a limited coverage and tracking problem. These methods increase the probability of interdiction of an adversary vehicle crossing a …

    mit Repository record for A Practical Search with Voronoi Distributed Autonomous Marine Swarms (opens in a new tab)

  10. Topological Characterization of Amorphous Silicon Structures Using Voronoi-Volume Analysis

    … properties of amorphous silicon (a-Si) through Voronoi volume analysis. Amorphous silicon exhibits a lack of long-range ordering, which leads to topological disorder, and it affects the atomic structure. Voronoi volumes of different a-Si structures have been measured by using Monte Carlo …

    usm Repository record for Topological Characterization of Amorphous Silicon Structures Using Voronoi-Volume Analysis (opens in a new tab)

  11. 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)

  12. 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)

  13. Construction of Centroidal Voronoi Tessellations Using A Conjugate Gradient Method Based On Trust Regions

    <p>A Voronoi tessellation whose generating points coincide with the centroids (mass centers) of the corresponding Voronoi regions is called a centroidal Voronoi tessellation (CVT). Due to the natural optimization properties enjoyed by CVTs, they have diverse applications in many areas of science …

    south-carolina Repository record for Construction of Centroidal Voronoi Tessellations Using A Conjugate Gradient Method Based On Trust Regions (opens in a new tab)

  14. Ramanujan's identities, Voronoi summation formula, and zeros of partial sums of zeta and L-functions

    Made available in DSpace on 2015-09-29T20:38:57Z (GMT). No. of bitstreams: 2 ROY-DISSERTATION-2015.pdf: 821854 bytes, checksum: 7abf6b7f9b1c512d8963ac66590c92b7 (MD5) LICENSE.txt: 4208 bytes, checksum: 502c6a39161a3e8620cd8507bf46885c (MD5) Previous issue date: 2015-08-03

    uiuc Repository record for Ramanujan's identities, Voronoi summation formula, and zeros of partial sums of zeta and L-functions (opens in a new tab)

  15. 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)

  16. Three Novel Algorithms for Triangle Mesh Processing: Progressive Delaunay Refinement Mesh Generation, Mls-Based Scattered Data Interpolation and Constrained Centroid Voronoi-Based Quadrangulation

    The last problem I address in the thesis is the conversion of triangle meshes to quadrilateral meshes. Although triangle meshes are preferred in most of applications, quadrilateral meshes show more stability in scientific computation. Because most of acquisition and mesh generation methods result …

    uiuc Repository record for Three Novel Algorithms for Triangle Mesh Processing: Progressive Delaunay Refinement Mesh Generation, Mls-Based Scattered Data Interpolation and Constrained Centroid Voronoi-Based Quadrangulation (opens in a new tab)

  17. 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)

  18. Decentralized mixing function control strategy for multi-robot informative persistent sensing applications

    … (1) minimum variance (probabilistic), (2) Voronoi approximation, or (3) Voronoi (geometric) sensing interpretations and resulting coverage strategies. As the robots travel along their paths, they continuously sample the environment and reshape their paths according to one of these three …

    mit Repository record for Decentralized mixing function control strategy for multi-robot informative persistent sensing applications (opens in a new tab)

  19. Order and Asymmetry in Jammed Systems

    … not as useful. We developed a new order metric, Voronoi entropy, based on Voronoi tessellation and information theory. The main idea of the Voronoi entropy is to detect and quantify unique Voronoi polyhedrons. Voronoi entropy can successfully find lattice order in bi-disperse crystal and other …

    cuny-grad Repository record for Order and Asymmetry in Jammed Systems (opens in a new tab)

  20. Discrete modelling of heat transfer

    … determined by the Delaunay triangulation and the Voronoi tessellation. The objective of the present work is to investigate in more detail this type of lattice model for heat transfer. In the lattice models studied here the domain to be analysed is discretised by a network of discrete lattice …

    glasgow Repository record for Discrete modelling of heat transfer (opens in a new tab)

Page 1 of 6