Given a set of points P=p1,p2,..pn in R2 in where pi=(xi,yi),finding the point with smallest x-ordinate having y-ordinates between y1 and y2, where y1 and y2 are given as inputs. I can compare the point with other points which gives me an O(n) time algorithm ? Can this be improved any further ?
$\begingroup$
$\endgroup$
1
-
$\begingroup$ This looks identical to cs.stackexchange.com/q/124557/755. Please don't re-post your question multiple times. $\endgroup$– D.W. ♦Commented Apr 27, 2020 at 7:38
Comments disabled on deleted / locked posts / reviews
|