query: get the closest points
positive_passages.docid: 17098
positive_passages.text: Efficient way to check collision with potentially hundreds of objects
negative_passages.docid: 53533
negative_passages.text: Fastest Way to Find Distance Between Two Lat/Long Points
negative_passages.docid: 12396
negative_passages.text: Finding a 4th point in 3D space knowing 3 other points and 2 distances to the 4th point from them
negative_passages.docid: 10044
negative_passages.text: Points at integer distance
negative_passages.docid: 73814
negative_passages.text: How to find the best route through multiple points?
negative_passages.docid: 48964
negative_passages.text: Finding the shortest distance between two lines
negative_passages.docid: 62296
negative_passages.text: Find nearest value in numpy array
negative_passages.docid: 45733
negative_passages.text: How to calculate the shortest path between two points in a grid
negative_passages.docid: 153112
negative_passages.text: Return bestMove in minimax algorithm for tictactoe
negative_passages.docid: 123426
negative_passages.text: Find the approximate center of a circle passing through more than three points
negative_passages.docid: 89379
negative_passages.text: Finding local maximum and minimum
negative_passages.docid: 122065
negative_passages.text: How to find the minimum/maximum distance of a point from elipse
negative_passages.docid: 41533
negative_passages.text: Finding three elements in an array whose sum is closest to a given number
negative_passages.docid: 36036
negative_passages.text: Find the point which is furthest away from existing points while remaining within the convex hull
negative_passages.docid: 158202
negative_passages.text: Minimum dimension to hold $N$ points with given distances?
negative_passages.docid: 81185
negative_passages.text: Tweaking AStar to find closest location to unreachable destination
negative_passages.docid: 134634
negative_passages.text: Queries to find places within a given lat/lng