I need to create a set that is the union of several triangles. Each triangle is characterized by its vertices, for example:
100 0; 0 34.92; 0 0
and
67.26 0; 0 98.67; 0 0
Then I need to check whether an arbitrary point is in this new set.
I have tried using the InterX and boundary functions with 8 lines corresponding to the hypotenuse of each triangle but, while it produced a reasonable graph of the new set, it did not really work. It did not result in a union of the triangles as it included too many vertices.
Any help is appreciated. Thanks!
Best Answer