Re: [gts-general] Gts-general Digest, Vol 28, Issue 2

[Olumide <50...@we...>]

> I start from a specific face (a triangle) of a surface and I have to 
> find a connected subset of triangles (containing T) with a specific 
> properties. 

You still haven't told us what you mean by connected at geometric level. 
Is it sufficient for triangles to share an edge or a single vertex 
(sharing an edge a stricter requirement that sharing a vertex -- each 
edge shares two vertexes). The extra topological information which you 
likened to color will only be considered for a pair of triangles that 
meet the first criteria of connectedness.

Furthermore, the approach to be taken will depend on whether the extra 
topological information is stored at vertex or face (triangle) level? 
Which is it? I don't think a graph is necessary. A marching algorithm 
along the surface should suffice. (Last week, I used the same principle 
to write a program that selects all vertexes enclosed within a path on a 
mesh.)

- Olumide