MathGroup Archive 2011

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Using Nearest on a group of points

  • To: mathgroup at smc.vnet.net
  • Subject: [mg117578] Re: Using Nearest on a group of points
  • From: DrMajorBob <btreat1 at austin.rr.com>
  • Date: Wed, 23 Mar 2011 02:54:58 -0500 (EST)

Start with ConvexHull, then worry about the interior points separately.

Bobby

On Tue, 22 Mar 2011 05:10:20 -0500, Martin VavpotiÄ?
<martin.vavpotic at gmail.com> wrote:

> Hello. I need some help with the function Nearest.
>
> I have a groups of points, each with two coordinates (x,y), describing
> a connected shape (the last point is a neighbor to the first one). The
> initial order of these points is completely scrambled but I need them
> to follow one another so their sequence describes a combined shape. I
> thought of using the Nearest function but there is a problem.
> Somewhere in the middle of my shape is a large gap where no points
> reside. I fear that if I use Nearest, the function will find the wrong
> point.
>
> What I need is for function Nearest to ignore points already sorted
> and search only for points that have not been used yet.
>


--
DrMajorBob at yahoo.com





  • Prev by Date: Multiple Integrals
  • Next by Date: Re: Handling conditions on subvector elements
  • Previous by thread: Re: Using Nearest on a group of points
  • Next by thread: Re: Using Nearest on a group of points