comp.lang.idl-pvwave archive: archive » Re: finding cluster boundary

Home » Public Forums » archive » Re: finding cluster boundary

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: finding cluster boundary [message #79245 is a reply to message #79244]

Wed, 08 February 2012 16:39

biophys
Messages: 68
Registered: July 2004

Member

Thanks, Ken. You are right. I was thinking of setting a threshold, if
the edge is bigger in length than the threshold we remove the edge and
detour to an interior point. However, I am not sure if this is the
best way to do it. If I wanted to do it this way, now the question is
given a set of triangles and boundary B returned by TRIANGULATE,

IDL>TRIANGULATE, X, Y, Triangles, B

What is the most efficient way of finding the matching triangle from
Triangles that contains the edge to be removed? i.e. if
Distance(B[i],B[i+1]) > threshold, the immediate detouring point will
be in the matching triangle [B[i], B[i+1], Detour]. This process will
go iteratively until all boundary edges are shorter than the
threshold. I don't know how the indices are organized in the output
from TRIANGULATE. Is there a faster way than looping through all
indices to find the matching triangle? Preferably an "IDL way" would
be cool. :)

Cheers,
BP
>
> I don't think there is a unique definition of the 'boundary points'
> in the way you are asking. How do you decide whether the boundary
> should detour to an interior point or not?
>
> Ken Bowman

Report message to a moderator

[Message index]

		Re: finding cluster boundary By: David Fanning on Wed, 08 February 2012 18:23
		Re: finding cluster boundary By: biophys on Wed, 08 February 2012 16:39
		Re: finding cluster boundary By: Kenneth P. Bowman on Wed, 08 February 2012 15:51

Previous Topic:	finding cluster boundary
Next Topic:	Counting Clicks in List Widgets

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 12:43:08 PDT 2025

Total time taken to generate the page: 0.87663 seconds