MathGroup Archive 2008

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

Search the Archive

Re: NearestFunction Algorithm

  • To: mathgroup at
  • Subject: [mg85549] Re: NearestFunction Algorithm
  • From: Jens-Peer Kuska <kuska at>
  • Date: Wed, 13 Feb 2008 06:56:17 -0500 (EST)
  • Organization: Uni Leipzig
  • References: <foue29$m1v$>
  • Reply-to: kuska at


I don't know what Mathematica actual does but

may give you a hint ..


jwmerrill at wrote:
> I'm looking to iteratively assign a list of initial points to a list
> of final points such that at each step, the initial point that is
> furthest from its nearest final point is assigned to its nearest final
> point.  That final points is then no longer available to other initial
> points.
> I noticed that you can speed up repeated uses of Nearest by calling it
> with only one argument in order to produce a NearestFunction, and then
> using that in later calculations.  Can anyone give me a clue about how
> this actually works?
> Is it possible to manipulate a NearestFunction in order to remove
> points that have already been assigned?
> Regards,
> Jason Merrill

  • Prev by Date: Re: Differential Equation
  • Next by Date: Re: Table / TableForm Question
  • Previous by thread: NearestFunction Algorithm
  • Next by thread: Re: NearestFunction Algorithm