Challenge #161: Triangles, Triangles, Triangles

[TungThanhHo]

my solution with some help from posted solutions

[martinding]

Spoiler

 

[grazitti_sapna]

Solution to this with great efforts:

[CammyPhillips]

Spoiler

Spoiler

[FinnCharlton]

Spoiler

[FrederikE]

Spoiler

[BS_THE_ANALYST]

Was a fun challenge! My interpretation of the problem was that each vertex of the triangle cannot share a longitude or latitude with any other vertex of that same triangle. I think that's the literal definition of non-collinear.

For my solution, it actually appeared that the furthest northeastern point and the furthest southeastern point lie on the same longitude. However, after checking the points themselves, this wasn't the case, so that is a valid triangle (non-collinear).

Lastly, I was concerned about comparing the different values for the longitudes/latitudes as the precision of a double might not be precise enough to equate two lats/longs. After checking the documentation, the datatype double is accurate up to 15 digits precision. Every data point is within this precision. 

Solution below:

Spoiler