Check points inside n number of triangle in a square

3 次查看（过去 30 天）
Boni_Pl
Boni_Pl 2019-7-17
回答： Bruno Luong 2019-7-17
Hello
In a square geometry n number of triangles and coordinates of each vertices are given.If N no. of points are in the medium then how to write for loop to check how many points are inside each of the triangle. Please help.
  1 个评论
infinity
infinity 2019-7-17
Hello,
I can give you an simplest idea to do this
1. write a function to check wheather a point is inside or not a triagle.
2. Use for loop for each point in N points and for loop for each triangle in n triangles. Then, count how many triangles containt this point.

请先登录，再进行评论。

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

采纳的回答

Bruno Luong
Bruno Luong 2019-7-17
see pointLocation method of Triangulation class

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Surface and Mesh Plots 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by