<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en-us" xmlns="http://www.w3.org/2005/Atom"><title>Simon Willison's Weblog: polylines</title><link href="http://simonwillison.net/" rel="alternate"/><link href="http://simonwillison.net/tags/polylines.atom" rel="self"/><id>http://simonwillison.net/</id><updated>2007-09-08T12:58:47+00:00</updated><author><name>Simon Willison</name></author><entry><title>Google Maps API gets clickable polylines and polygons</title><link href="https://simonwillison.net/2007/Sep/8/official/#atom-tag" rel="alternate"/><published>2007-09-08T12:58:47+00:00</published><updated>2007-09-08T12:58:47+00:00</updated><id>https://simonwillison.net/2007/Sep/8/official/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="http://googlemapsapi.blogspot.com/2007/09/v288-clickable-polylines-polygons.html"&gt;Google Maps API gets clickable polylines and polygons&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Interesting explanation of how they optimised calculating the distance to the nearest point on a polyline.


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/algorithms"&gt;algorithms&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/googelmaps"&gt;googelmaps&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/google"&gt;google&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/javascript"&gt;javascript&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/polygons"&gt;polygons&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/polylines"&gt;polylines&lt;/a&gt;&lt;/p&gt;



</summary><category term="algorithms"/><category term="googelmaps"/><category term="google"/><category term="javascript"/><category term="polygons"/><category term="polylines"/></entry></feed>