views:

279

answers:

1

Hi,

How would I go about constructing the contour of 2d figure which is formed of only triangles and it can have holes and the external contour can be concave/convex and the holes can also be concave/convex.

From what I'm reading over here it seems that It's exactly the inverse of the triangulation problem. Do you know any articles treating this ?

It seems I'm missing a headstart or some article treating exactly this type of problem.

Are octrees/quadtrees relevant to this ?

+4  A: 

I guess that you have data in the form of sets of three points, which constitute a "filled" triangle, that these triangles are adjoined along edges, and that all vertices that will be corners of the complete shape are also vertices of all the triangles that touch this point. You would then just have to find all edges that are not doubled, i.e. do not belong to two adjoined triangles.

Svante
ok,and we're left with a set of points.connecting them to find out the result of the problem is nontrivial,or is it ?
xxxxxxx
I am not sure if I understand you, spx2, but after eliminating all doubled edges, you are left with the ones that constitute the contour.
Svante
@Svante, I think he wants to know how to get the points of the contour in order instead of start-end pairs. Also, consider inputs which may result in multiple contours?
Vulcan Eager