Location:
Search - voronoi m
Search list
Description: 用MFC实现的voronoi算法，简单实用，值得一看！-Using MFC realize the voronoi algorithm, simple and practical, worth a visit!
Platform: |
Size: 8318976 |
Author: 沙雁 |
Hits:
Description: Voronoi test diagram
Platform: |
Size: 1024 |
Author: Sylvain |
Hits:
Description: Dijkstra算法,关于 Dijkstra算法解决voronoi图的问题,用 Dijkstra算法解决voronoi图中求解最短路径的时候,有一个"dijkstra.m"的文件-Dijkstra algorithm voronoi diagram on Dijkstra algorithm to solve the problem, using Dijkstra algorithm to solve voronoi diagram for solving the shortest path, there is a " dijkstra.m" file
Platform: |
Size: 3072 |
Author: 肖杰飞 |
Hits:
Description: How to use the ordinary Voronoi partition generator. The m-files also have
their own help documentation that you can view in Matlab. This code creates
a bounding polygon that is a square. Then it randomly creates 10 points
and then creates and draws the partition.
bounds = [0, 10, 10, 0 0, 0, 10, 10]
points = 10 * rand(2, 10)
regions = voronoi(bounds, points)
drawRegions(bounds, regions)
================================
This is a brief set of instructions on how to use the Multiplicatively-
weighted Voronoi partition generator.
Each of the m-files has a help section, so in Matlab you can call:
help mwvoronoi
help drawRegions
Here is an example that creates a bounding polygon, a square with side
length 10. Then it randomly creates six points with random weights.
Finally, the code draws the resulting partition.
bounds = [0, 10, 10, 0 0, 0, 10, 10]
points = 10 * rand(3, 6)
regions = mwvoronoi(bounds, points)
drawRegions(bounds, regions)
Enjoy!
-How to use the ordinary Voronoi partition generator. The m-files also have
their own help documentation that you can view in Matlab. This code creates
a bounding polygon that is a square. Then it randomly creates 10 points
and then creates and draws the partition.
bounds = [0, 10, 10, 0 0, 0, 10, 10]
points = 10 * rand(2, 10)
regions = voronoi(bounds, points)
drawRegions(bounds, regions)
================================
This is a brief set of instructions on how to use the Multiplicatively-
weighted Voronoi partition generator.
Each of the m-files has a help section, so in Matlab you can call:
help mwvoronoi
help drawRegions
Here is an example that creates a bounding polygon, a square with side
length 10. Then it randomly creates six points with random weights.
Finally, the code draws the resulting partition.
bounds = [0, 10, 10, 0 0, 0, 10, 10]
points = 10 * rand(3, 6)
regions = mwvoronoi(bounds, points)
drawRegions(bounds, regions)
Enjoy!
Platform: |
Size: 13312 |
Author: S |
Hits:
Description: Voronoi diagram for real HetNet design.
Platform: |
Size: 1024 |
Author: wed |
Hits:
Description: This function compute the individual Voronoi cell area of point sets bounded in a unit circle.
Inputs:
x : M x 1 array of x-coordinates
y : M x 1 array of y-coordinates
toggleplot : 1 to turn on figures, 0 to turn off figures;
Outputs:
CellArea : M x 1 array of Voronoi cell area bounded in a unit circle
Platform: |
Size: 6144 |
Author: 未央佛 |
Hits: