Check points inside n number of triangle in a square

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.

[infinity]

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.

Answer 1

[Bruno Luong]

see pointLocation method of Triangulation class