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

1 次查看（过去 30 天）
Steve
Steve 2019-12-5
评论： 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 个评论
显示 1更早的评论
Steve
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!

请先登录，再进行评论。

请先登录，再回答此问题。

回答（1 个）

Steven Lord
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 个评论
显示 2更早的评论
Steve
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!

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Voronoi Diagram 的更多信息

标签

产品


版本

R2019a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by