Question

使用Google Maps api 3，我有一个包含点击事件的折线。我需要找出用户点击的路径中的哪两个点。理想情况下是积分的指数。

以下是一个主要直接来自谷歌文档的示例页面，但添加了点击事件。实际的应用程序具有更复杂的折线。

有办法吗？

非常感谢

<!DOCTYPE html>
<html>
<head>
<meta name="viewport" content="initial-scale=1.0, user-scalable=no">
<meta charset="utf-8">
<title>Polylines</title>
<style>    
  #map {
    height: 100%;
  }
  /* Optional: Makes the sample page fill the window. */
  html, body {
    height: 100%;
    margin: 0;
    padding: 0;
  }
  </style>
 </head>
 <body>
      <div id="map"></div>
      <script>
      function initMap() {
          var map = new google.maps.Map(document.getElementById('map'), {
          zoom: 3,
          center: {lat: 0, lng: -180},
          mapTypeId: 'terrain'
      });

      var flightPlanCoordinates = [
         {lat: 37.772, lng: -122.214},
         {lat: 21.291, lng: -157.821},
         {lat: -18.142, lng: 178.431},
         {lat: -27.467, lng: 153.027}
      ];

      var poly = new google.maps.Polyline({
         path: flightPlanCoordinates,
         geodesic: true,
         strokeColor: '#FF0000',
         strokeOpacity: 1.0,
         strokeWeight: 2
       });

       poly.setMap(map);


       google.maps.event.addListener(poly, 'click', function(e) {            
         alert(JSON.stringify(e));
       });

     }
</script>
<script async defer
src="https://maps.googleapis.com/maps/api/js?key=MYAPIKEY&callback=initMap">
</script>

Answer 1

尝试：

    poly.addListener('click', function () {
         getPathVariableCode(poly);
     });
 poly.setMap(map);

    function getPathVariableCode(line){
    var codeStr = '  var linePath = [\n';
    var pathArr = line.getPath();
    for (var i = 0; i < pathArr.length; i++){
        codeStr += '    {lat: ' + pathArr.getAt(i).lat() + ', lng: ' + pathArr.getAt(i).lng() + '}' ;
        if (i !== pathArr.length-1) {
            codeStr += ',\n';
        };

    };

    codeStr += '\n  ];';

    //the coordinates path it´s print on the console of the browser

    console.log (codeStr);
    console.log(pathArr.length);

};

Answer 2

以下快速而肮脏的代码可能不是最好的并且可以进行优化，但是我一年到头都在使用它。

我在聚合点击事件中的代码：

    rc = getNearestVertex(poly, event.latLng);
    x = rc.split(":");  //rc = "index:minDiff"
    vertIndex = x[0] *1;
    markerIndexes = vertIndex + ',' +(vertIndex + 1);

我用它来标记折线上标记之前的点和标记之后的点。遵循功能：

function getNearestVertex(poly, pLatLng) {
    // test to get nearest point on poly to the pLatLng point
    // click is on poly, so the nearest vertex is the smallest diff between
    var minDist = 9999999999;
    var minDiff = 9999999999;
    var path = poly.getPath();
    var count = path.length || 0;

    for (var n = 0; n < count - 1; n++) {
        if (n == 0) {
            point = path.getAt(n); 
            dist = g.geometry.spherical.computeDistanceBetween(pLatLng, point);
        }
        //g.geometry.spherical.computeDistanceBetween(aLatLng, bLatLng)
        var pointb = path.getAt(n + 1);
        distb =  g.geometry.spherical.computeDistanceBetween(pLatLng, pointb);
        distp2p = g.geometry.spherical.computeDistanceBetween(point, pointb);
        var pdiff = dist + distb - distp2p;

        //alert(n + " / " +dist +" + " +distb +" - " +distp2p +" = " +pdiff);
        if (pdiff < minDiff) {
            minDiff = pdiff.toFixed(3);
            index = n;
        }
        point = pointb;
        dist = distb;
    } //-> end for
    //alert(index +":" + minDiff);
    return index +":" + minDiff;
} //-> end of getNearestVertex

也许有更好的js和数学的人。知识可以进入并改进代码。然而，据说它对我有用，我的自行车之旅的跟踪点很少超过2-3-tsd。分数

Google地图折线点击点之间

2 个答案: