Skip to main content

performance tuning - How to rapidly find the nearest pairs of points in different clusters


Background


For speed up this question or this question,I have such need.


Current try:


Suppose I have $3$ clusters of points:


list = {{{0, 0}, {.2, 0}}, {{2, 1}, {2, 2}, {2, 2.5}}, {{1.5, 
     6}, {1.6, 7}, {1.4, 8}, {1.9, 10}}};
plot = ListPlot[list, Axes -> False, Frame -> True, PlotLegends ->Automatic,
  FrameTicks -> None]



I want to find the closest pairs of points, each point in a different cluster. My current method:


Method one based on Tuples


tuplesMethod[list_] := 
 First[MinimalBy[Tuples[#], EuclideanDistance @@ # &]] & /@ 
  Subsets[list, {2}]

Method two based on Nearest


nearestMethod[list_] := 

 Module[{f, var1, var2}, f = Nearest /@ Most[list];
  var2 = Drop[list, #] & /@ Range[Length[list] - 1];
  var1 = MapThread[Catenate /@ # /@ #2 &, {f, var2}];
  Catenate[
   Map[First[MinimalBy[#, EuclideanDistance @@ # &]] &, 
    Flatten[{var1, var2}, List /@ {2, 3, 4, 1, 5}], {2}]]]

Usage:


minDistPoints = tuplesMethod[list]



{{{0.2,0},{2,1}},{{0.2,0},{1.5,6}},{{2,2.5},{1.5,6}}}



Show it:


Show[plot, Epilog -> Line /@ minDistPoints]



But the current method is too slow, if clusters up to 10,the execution time will be cannot stand:


testPoint[n_] := (SeedRandom[2];

  FindClusters[RandomReal[10 n, {20 n, 2}], n])

GeneralUtilities`BenchmarkPlot[{tuplesMethod, 
  nearestMethod}, testPoint, 2, TimeConstraint -> 50, 
 "IncludeFits" -> True]



Answer



The Nearest method should do well, but you need to make sure that it is only applied once for each cluster. Here is how I would code it. First a helper function, that finds the nearest members between one cluster and a list of other clusters:


icluster[i_, rest_]:=Module[{r, near,distances, rank,pos},

    (* create a single list of other points *)
    r = Catenate[rest];

    (* apply NearestFunction to the list of other points *)
    near = Nearest[i][r][[All, 1]];

    (* compute distance squared between the nearest member and the other point *)
    distances = Total[(near-r)^2, {2}];

    (* rank the distances *)

    rank = Ordering @ Ordering @ distances;

    (* find the minimum rank for each cluster. Probably could be sped up *)
    pos = Flatten @ Position[
        rank,
        Alternatives @@ Min /@ Internal`PartitionRagged[rank, Length/@rest]
    ];

    (* extract near point and other points for minimum ranks *)
    Transpose[{near[[pos]], r[[pos]]}]

]

We use this helper function to get the members of the clusters closest to each other:


nearestClusterMembers[list_] := Catenate @ Table[
    icluster[list[[i]], list[[i+1 ;; -1]]],
    {i, Length[list]-1}
]

For your simple example:


nearestClusterMembers[

    {
    {{0,0},{.2,0}},
    {{2,1},{2,2},{2,2.5}},
    {{1.5,6},{1.6,7},{1.4,8},{1.9,10}}
    }
]


{{{0.2, 0}, {2, 1}}, {{0.2, 0}, {1.5, 6}}, {{2, 2.5}, {1.5, 6}}}




Comments

Post a Comment

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...
Post a Comment
Read more

equation solving - Invert and fit implicitly defined curve

I need to fit an implicitly defined curve. I thought I could get some data out of Solve , and then using FindFit . Therefore, I would like to find the relation the parametric curve defined by $F(x,y)=0$: Solve[-(1/2) + 1/2 (0.41202 BesselK[0, 0.1 Sqrt[x^2 + y^2]] + (0.101483 x BesselK[1, 0.1 Sqrt[x^2 + y^2]])/Sqrt[x^2 + y^2]) == 0, y] But I can't get an output: Solve was unable to solve the system with inexact coefficients or the system obtained by direct rationalization of inexact numbers present in the system. Since many of the methods used by Solve require exact input, providing Solve with an exact version of the system may help. >> Edit: In particular, I would like to fit the data coming from the curve with the expression of another curve, and not with a function $f(x)$. In particular, since this clearly looks like a cardioid , I would like it to fit to something like it. What other strategies could I try?
Post a Comment
Read more

dynamic - How can I make a clickable ArrayPlot that returns input?

I would like to create a dynamic ArrayPlot so that the rectangles, when clicked, provide the input. Can I use ArrayPlot for this? Or is there something else I should have to use? Answer ArrayPlot is much more than just a simple array like Grid : it represents a ranged 2D dataset, and its visualization can be finetuned by options like DataReversed and DataRange . These features make it quite complicated to reproduce the same layout and order with Grid . Here I offer AnnotatedArrayPlot which comes in handy when your dataset is more than just a flat 2D array. The dynamic interface allows highlighting individual cells and possibly interacting with them. AnnotatedArrayPlot works the same way as ArrayPlot and accepts the same options plus Enabled , HighlightCoordinates , HighlightStyle and HighlightElementFunction . data = {{Missing["HasSomeMoreData"], GrayLevel[ 1], {RGBColor[0, 1, 1], RGBColor[0, 0, 1], GrayLevel[1]}, RGBColor[0, 1, 0]}, {GrayLevel[0], GrayLevel...
Post a Comment
Read more