How to divide the space into a mesh of triangles (count)?

Hello!

There is an area of the Pixies. I need to build a graph of paths in this area. That is, divide the whole space into triangles, and vertices write to the graph.
What algorithms can be used for such tasks? (If it's important, I write in Python)
June 14th 19 at 20:07
1 answer
June 14th 19 at 20:09
Solution
And if you could use a Delaunay triangulation?
And how it is applied to Delaunay I can use the Hough transform?
Is it possible this whole thing is to unite, not to get away from the job?
(A common task is to to move the robot to partition the space into triangles.) - margie29 commented on June 14th 19 at 20:12
I do not quite understand what the Hough transform is necessary. Judging by the description - it's not what you need. - Craig.Lebsack79 commented on June 14th 19 at 20:15
Asked Professor of atmo issue. He said that without hafa. For each vertex count the rays, which diverge in different directions, and then the intersection of the rays considered. It turns out, the denser the dots, the more rays, the denser the grid. - margie29 commented on June 14th 19 at 20:18
While taking these points? What reference point? - margie29 commented on June 14th 19 at 20:21
Here is the part of the algorithm:
On the plane there are other objects (square, round and other shapes). Build straight, tangent to shapes and they take point. It is not quite clear how to take point on these lines? How many of them there need?
Yes, mesh will work, but how to manage its platnou? Just after every a fixed distance to take the point maybe? - margie29 commented on June 14th 19 at 20:24
you lecturer wrote - "Data Points are the center points of the line segments in the free area". Ie take the centre of every found line. - Craig.Lebsack79 commented on June 14th 19 at 20:27

Find more questions by tags Mathematics