英文:
Finding the closest polyline to a given point
问题
我正在开发一个使用Google Maps API的安卓应用程序。
我正在寻找一种算法，可以帮助我找到距离给定点最近的折线。我有一个地图上有100个折线，并且我想找到距离给定点最近的折线。
一个示例可以在以下图片中看到，红点是位置，蓝线是一些折线。我可以访问折线上的所有点。我考虑过一些方式来利用起始点和结束点，但我不确定如何做。
目前，我只是在所有折线的列表中进行迭代，但这并不是很高效，我希望提高应用程序的性能。
样例代码：
for (Map.Entry<String, ArrayList<List<LatLng>>> entry : map.entrySet()) {entry.getValue().stream().parallel().forEach(obj -> {boolean isonPath = PolyUtil.isLocationOnPath(currentLocation, obj, true, 100);if (isonPath) {// 如果点在路径上，则执行某些操作}});}
英文:
I'm working on an android app which uses the Google Maps API.
I'm looking for an algorithm which would help me find the closest polyline to a given point. I've a map with 100 polylines, and I would like to find the closest polyline to a given point.
An example would be in the following picture where the red dot is the location and the blue lines are some of the polylines. I have access to all the points on the polyline. I was thinking to leverage the starting and ending point somehow but I'm not sure how to.
At the moment I'm simply iterating over all the list of polylines, but it's not very efficient and I'm looking to improve the performance of the application
Sample code:
for (Map.Entry<String, ArrayList<List<LatLng>>> entry : map.entrySet()) {entry.getValue().stream().parallel().forEach(obj -> {boolean isonPath = PolyUtil.isLocationOnPath(currentLocation, obj, true, 100);if (isonPath) {// do something if the point is on the path}});}
专注分享java语言的经验与见解，让所有开发者获益！
评论