- Subdivide the polyshape into triangles. You already have a polyshpe utility to triangulate a region, so this is trivial.
- Compare the areas of each triangle. Find the largest triangle in area. If it is too large, the split it in half, probably by splitting the longest edge of that triangle in half. That will SOMETIMES force you to also divide another triangle into two triangles, because the edge you chose was a shared edge. Such is life.
Subdividing a 2-D Polygonal Shape Using Values Given in an Array
13 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Melanie VT
el 11 de Jun. de 2023
Comentada: Melanie VT
el 11 de Jun. de 2023
Hi,
I have a 2D polygonal shape, let’s assume it’s 1000 m2, and an array containing some values. What I want to do is to create subdivisions within the polyshape corresponding to the values in the array. It doesn't necessarily have to be as regular as shown in the example image below. I’ve tried many things but couldn’t succeed. Any suggestions would be greatly appreciated.
Thanks in advance,
Mel
0 comentarios
Respuesta aceptada
John D'Errico
el 11 de Jun. de 2023
Editada: John D'Errico
el 11 de Jun. de 2023
Sadly, this is an impossible task to do perfectly. Even imperfectly is difficult. And wanting quadrilaterals makes it harder yet. (Yes, that is doable too, but more work.) And if you want to specify the number of objects in the dissection, again, that will be a significant problem.
A simple solution is perhaps better, that would be based on a triangulation.
Essentially, the above is a pretty simple solution. It results in a triangulation, and you can simply enough make the triangles not too different in area.
Could you form a dissection that always resulted in a set of convex quadrilaterals? Yes. Not difficult, but not so easy if you want to fix the number of quads in the result, or to give a target for their area. That is, I just told you above how to dissect a polyshape into triangles. Now take each triangle and dissect it into quadrilateral regions. That is easy enough to do, splitting any triangle into exactly THREE quadrilateral subdomains. (Think about it. Is there an easy way to solve that problem?)
help polyshape/triangulation
For example...
xy = [0 0;1 0;1.2 2.5;1 4;0 4];
ps = polyshape(xy);
plot(ps)
axis equal
So qualitatively a similar shape, I was feeling too lazy to replicate the exact one shown by @Melanie VT.
Now we can triangiulate it.
pstri = triangulation(ps)
trimesh(pstri.ConnectivityList,pstri.Points(:,1),pstri.Points(:,2))
axis equal
hold on
plot(ps)
hold off
Again, if one of those triangles is too large, we can subdivide it as needed. Or, I could subdivide each triangle into 3 quads. For example, given this triangulation, I'll pick one triangle, then split it into three quad regions.
T1 = pstri.ConnectivityList(1,:)
xy1 = pstri.Points(T1,:)
xy1 = [xy1;[.5 .5 0;.5 0 .5;0 .5 .5;1/3 1/3 1/3]*xy1]
Q1 = [1 4 7 5;2 4 7 6;3 5 7 6];
% replot, with the subdivided triangle added on top
trimesh(pstri.ConnectivityList,pstri.Points(:,1),pstri.Points(:,2))
axis equal
hold on
plot(ps)
plot(xy1(:,1),xy1(:,2),'ko')
line(reshape(xy1(Q1',1),4,3),reshape(xy1(Q1',2),4,3))
I dissected one of those triangles into 3 quads. This would be doable for all of the triangles in one vectorized operation too.
Honestly, I don't know the final goal of this question. Why do you need to quadrangulate a polyshape? (Is quadrangulation even a word? Dissect into quadrilateral subdomains is probably a correct description of the request.) But even then, I don't know the final goal, or what would be an acceptable solution. My recommendation is, since triangulations are so easy to work with, and since the tools in MATLAB to handle triangulations are all there, to learn to work with them instead.
Más respuestas (0)
Ver también
Categorías
Más información sobre Elementary Polygons en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!