Algorithm for creating a polygon from a group of adjacent triangles

Question

Suppose you have a set of triangles, like the one shown in the image below, where black is a triangle edge, red is a triangle point, green is the polygon that needs to be found, and blue is the polygon's points.

The polygon described may or may not be concave. The triangles in it will always be adjacent (share all three points with the other triangles in the set). What sort of algorithms exist to generate the polygon that such a set of triangles describes? The polygon should be in the form of a list of points in clockwise or counter-clockwise order.

Answer 1

How About Following A simple GrahamScan Algo... That's should Do the Trick.