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

2 views (last 30 days)
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 Comments
Steve
Steve on 5 Dec 2019
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!

Sign in to comment.

Answers (1)

Steven Lord
Steven Lord on 5 Dec 2019
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 Comments
Steve
Steve on 5 Dec 2019
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!

Sign in to comment.

Categories

Find more on Voronoi Diagram in Help Center and File Exchange

Products


Release

R2019a

Community Treasure Hunt

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

Start Hunting!