comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: finding cluster boundary
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: finding cluster boundary [message #79246 is a reply to message #79245] Wed, 08 February 2012 15:51 Go to previous message
Kenneth P. Bowman is currently offline  Kenneth P. Bowman
Messages: 585
Registered: May 2000
Senior Member
In article <a3d4e3c3-b379-48fb-aea9-e98ed9af35e5@n8g2000pbc.googlegroups.com>,
biophys <biophys@gmail.com> wrote:

> Hi, Folks
>
> I've got a collection of 2D points that have already been identified
> as a cluster. Is there a quick way to extract the boundary points of
> the cluster? I understand the easiest way is to use TRIANGULATE
> procedure to get the boundary points in counterclockwise order.
> However, the points returned are like a convex envelope of the cluster
> which does not represent the real shape of the cluster. It looks like
> that I might need to specify that the edge of the boundary polygon can
> not be larger than a certain length. Any suggestions?

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
[Message index]
 
Read Message
Read Message
Read Message
Previous Topic: finding cluster boundary
Next Topic: Counting Clicks in List Widgets

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 03:29:56 PDT 2025

Total time taken to generate the page: 1.04011 seconds