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

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.

[Sean de Wolski]

Can you provide an example of your data and what you want from it?

[Steve]

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]

Answer 1

[Steven Lord]

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.

[Sean de Wolski]

This was my thought as well but it isn't clear how he wants to define the polygons. I thought that might be what delaunay/voronoi are for.

[Steve]

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]

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]

Is anyone able to help us with this?