清空筛选条件
清空筛选条件

How to triangulate a non-convex ordered set of points?

11 次查看（过去 30 天）
Luca M
Luca M 2021-1-23
回答： Luca M 2021-1-23
I have a polygon defined by this anti-clockwise ordered set of points
points = [0 0; 1 0; 0.5 0.5; 1 1; 0 1];
patch(points(:, 1), points(:, 2))
I'd like to have any triangulation of this non convex polygon available. I know that delaunayTriangulation is only for convex-hulls.
I need something that can be automated for an arbitray (connected) non-convex or convex polygon (always ordered anti-clockwise). I know that alphaShape can be used somehow for this, but from the documentation I have no idea how to automate the creation of the correct non-convex polygon using an alphaShape.
The alternative I have is computing the constrained (else I could create holes) delaunay triangulation and then removing manually the triangles whose baricenter is outside the polygon (if there is a way to check), but I hope there is a better way for this.
Thanks for tips.

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

采纳的回答

Luca M
Luca M 2021-1-23
T = triangulation(polyshape(points));
triplot(T)

更多回答（1 个）

Bruno Luong
Bruno Luong 2021-1-23
I recommednd this Mesh2D FEX
  1 个评论
Luca M
Luca M 2021-1-23
Thank you, but I found out a very simple solution. Using a polyshape object:
T = triangulation(polyshape(points));
triplot(T)

请先登录，再进行评论。

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by