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 #79244]

Wed, 08 February 2012 18:23

David Fanning
Messages: 11724
Registered: August 2001

Senior Member

biophys writes:

> 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. :)

I think this is something MESH_DECIMATE might do.

Cheers,

David

--
David Fanning, Ph.D.
Fanning Software Consulting, Inc.
Coyote's Guide to IDL Programming: http://www.idlcoyote.com/
Sepore ma de ni thui. ("Perhaps thou speakest truth.")

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: Sat Nov 29 07:55:41 PST 2025

Total time taken to generate the page: 0.80583 seconds