# How would I use Voronoi and/or Delaunay Triangulation methods for information on polygons

2 ビュー (過去 30 日間)
Steve 2019 年 12 月 5 日
Commented: Steve 2019 年 12 月 8 日
I have some coordinates, which are the nodes for a network of polygons. How do I use Voronoi and/or Delaunay Triangulation methods to find information on these polygons (i.e., number of polygons, number of edges for each polygon, areas of each polygon). Any help on this would be greatly appreciated.

#### 3 件のコメント

Sean de Wolski 2019 年 12 月 5 日
Can you provide an example of your data and what you want from it?
Steve 2019 年 12 月 5 日
Thanks for your input! Attached is a file containing the coords of the nodes of the polygons (for straight edges) as well as another file containing auxiliary information (arc points circular arc edges, etc.). If anyone is able, please provide some MATLAB code that will give me the desired information about the aforementioned polygons. Thanks again!
Steve 2019 年 12 月 5 日

サインイン to comment.

### 件の回答 (1)

Steven Lord 2019 年 12 月 5 日
Why not just create a polyshape or an array of polyshape objects on which to operate? The NumRegions property gives you the number of polygons, the numsides function gives you the number of sides, and the area function gives you the area. For more information on polyshape see the elementary polygons page in the documentation.

#### 4 件のコメント

Steve 2019 年 12 月 5 日
Thanks for your suggestion Steven. I am not familiar with the methods you described. I will try to read up on how to use polyshape in a script--it sounds like the perfect solution.
Steve 2019 年 12 月 5 日
I can't seem to get started on the code for polyshape. Could anyone present some preliminary code using the coordinates in the files attached above? Thank you!
Steve 2019 年 12 月 8 日
Is anyone able to help us with this?

サインイン to comment.

サインイン してこの質問に回答します。

R2019a

Translated by