server-side-google-maps 0.1.1 → 0.1.2

data/lib/server-side-google-maps/path.rb

@@ -77,8 +77,37 @@ module ServerSideGoogleMaps
       ret << create_interpolated_point(points[-1], points[-1], 0.0, :distance_along_path => points[-1].distance_along_path)
     end
 
+    def simplify(latlng_error2)
+      simplified_points = douglas_peucker_step(points, latlng_error2)
+      Path.new(simplified_points)
+    end
+
     private
 
+    def douglas_peucker_step(points, latlng_error2)
+      simple_points = [ points.first, points.last ]
+      max_i = 0
+      max_d = 0
+
+      points.each_with_index do |point, i|
+        next if i == 0 || i == points.length - 1
+        d = point.latlng_distance_squared_from_segment(points.first, points.last)
+        if d > max_d
+          max_d = d
+          max_i = i
+        end
+      end
+
+      if max_d > latlng_error2
+        simple1 = douglas_peucker_step(points[0..max_i], latlng_error2)
+        simple2 = douglas_peucker_step(points[max_i..-1], latlng_error2)
+        simple1.pop
+        return simple1.concat(simple2)
+      else
+        return simple_points
+      end
+    end
+
     def create_interpolated_point(point_before, point_after, fraction_after, options = {})
       fraction_before = 1.0 - fraction_after
 

data/lib/server-side-google-maps/point.rb

@@ -45,5 +45,32 @@ module ServerSideGoogleMaps
       longitude_difference = longitude - other.longitude
       latitude_difference * latitude_difference + longitude_difference * longitude_difference
     end
+
+    def latlng_distance_squared_from_segment(p1, p2)
+      vx = p1.latitude - latitude
+      vy = p1.longitude - longitude
+
+      return vx*vx + vy*vy if p1 == p2
+
+      ux = p2.latitude - p1.latitude
+      uy = p2.longitude - p1.longitude
+      length2 = ux*ux + uy*uy
+
+      det = (-vx*ux) + (-vy*uy)
+
+      if det < 0 || det > length2
+        # We're outside the line segment
+        wx = p2.latitude - latitude
+        wy = p2.longitude - longitude
+
+        d1 = vx*vx + vy*vy
+        d2 = wx*wx + wy*wy
+        return d1 < d2 ? d1 : d2
+      end
+
+      det = ux*vy - uy*vx
+
+      return det * det / length2
+    end
   end
 end

data/lib/server-side-google-maps/version.rb

@@ -1,3 +1,3 @@
 module ServerSideGoogleMaps
-  VERSION = "0.1.1"
+  VERSION = "0.1.2"
 end

data/spec/path_spec.rb

@@ -116,5 +116,61 @@ module ServerSideGoogleMaps
         interpolated[4].elevation.should == 50
       end
     end
+
+    describe('#simplify') do
+      it('should remove duplicate points') do
+        p1 = Point.new(1.0, 2.0)
+        p2 = Point.new(7.0, 2.0)
+        p2_2 = Point.new(7.0, 2.0)
+        p3 = Point.new(7.0, 1.0)
+
+        path = Path.new([p1, p2, p2_2, p3])
+        simplified = path.simplify(0.00001)
+        simplified.points.length.should == 3
+        simplified.points[0].should == p1
+        simplified.points[1].should == p2
+        simplified.points[2].should == p3
+      end
+
+      it('should remove useless points') do
+        p1 = Point.new(1.0, 2.0)
+        p2 = Point.new(6.0, 1.23)
+        p3 = Point.new(7.0, 1.0)
+
+        path = Path.new([p1, p2, p3])
+        simplified = path.simplify(0.005)
+        simplified.points.length.should == 2
+        simplified.points[0].should == p1
+        simplified.points[1].should == p3
+      end
+
+      it('should retain useful points') do
+        p1 = Point.new(1.0, 2.0)
+        p2 = Point.new(6.0, 1.23)
+        p3 = Point.new(7.0, 1.0)
+
+        path = Path.new([p1, p2, p3])
+        simplified = path.simplify(0.0005)
+        simplified.points.length.should == 3
+        simplified.points[0].should == p1
+        simplified.points[1].should == p2
+      end
+
+      it('should retain :distance_along_path, :elevation, :object') do
+        p1 = Point.new(1.0, 2.0, :distance_along_path => 0, :elevation => 0, :object => 0)
+        p2 = Point.new(6.0, 1.23, :distance_along_path => 1, :elevation => 1, :object => 1)
+        p3 = Point.new(7.0, 1.0, :distance_along_path => 2, :elevation => 2, :object => 2)
+
+        path = Path.new([p1, p2, p3])
+        simplified = path.simplify(0.005)
+        simplified.points.length.should == 2
+        simplified.points[0].object.should == p1.object
+        simplified.points[0].distance_along_path.should == p1.distance_along_path
+        simplified.points[0].elevation.should == p1.elevation
+        simplified.points[1].object.should == p3.object
+        simplified.points[1].distance_along_path.should == p3.distance_along_path
+        simplified.points[1].elevation.should == p3.elevation
+      end
+    end
   end
 end

data/spec/point_spec.rb

@@ -39,6 +39,29 @@ module ServerSideGoogleMaps
       end
     end
 
+    describe('#latlng_distance_squared_from_segment') do
+      it('should catch when point is outside segment edges') do
+        # p1 ------------*---------
+        # p2 --*------------------- <- this point is farther than it'd be if the
+        # p3 -------------------*--    line segment were an infinite line
+        p1 = Point.new(1.0, 7.0)
+        p2 = Point.new(-1.0, 9.1)
+        p3 = Point.new(7.0, 1.0)
+
+        distance2 = p2.latlng_distance_squared_from_segment(p1, p3)
+        distance2.should == p2.latlng_distance_squared(p1)
+      end
+
+      it('should work when segment is a singularity') do
+        p1 = Point.new(1.0, 7.0)
+        p2 = Point.new(-1.0, 9.1)
+        p3 = Point.new(1.0, 7.0)
+
+        distance2 = p2.latlng_distance_squared_from_segment(p1, p3)
+        distance2.should == p2.latlng_distance_squared(p1)
+      end
+    end
+
     describe('#distance') do
       it('should calculate the distance') do
         point1 = Point.new(1.0, 4.0)

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: server-side-google-maps
 version: !ruby/object:Gem::Version 
-  hash: 25
+  hash: 31
   prerelease: 
   segments: 
   - 0
   - 1
-  - 1
-  version: 0.1.1
+  - 2
+  version: 0.1.2
 platform: ruby
 authors: 
 - Adam Hooper