point-in-polygon 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 6856f067378b3e269b10a940e4bbc90c5df0c659
+  data.tar.gz: e1db949b8ba37386ea0e7c02237c0f16e42f6dbd
+SHA512:
+  metadata.gz: 1de4e2d19f13b1334f7b82f05c8c69bc6c5afe7df1590fab6b24f665c56b3ddc6555fc76fb2168b35a77b076ca80d851fa46c2a8affdd2a3ba50f623036fdd18
+  data.tar.gz: fc994585481e2720537e5f4d6f82fa1b7f98037652f008b873429dd7ca07d6a7def4dbb8803bb021976b2b18e9db68e775bebfbecc7e64a81a69604dc2008e32

data/lib/point-in-polygon.rb

@@ -0,0 +1,2 @@
+require "point-in-polygon/Point"
+require "point-in-polygon/Polygon"

data/lib/point-in-polygon/Point.rb

@@ -0,0 +1,13 @@
+require "matrix"
+class Point < Vector
+  # attr_accessor :p
+
+  # def initialize()
+  #   super
+  # end
+
+  # def reset(x, y)
+  #   @x = x
+  #   @y = y
+  # end
+end

data/lib/point-in-polygon/Polygon.rb

@@ -0,0 +1,77 @@
+require "matrix"
+class Polygon
+
+  def initialize(p)
+    @sides = p.length
+    @vertices = sort(p)
+  end
+
+  def isConvex
+    vectors = []
+    for i in 1..@sides
+      vectors << @vertices[i % @sides] - @vertices[i-1]
+    end
+    cross_product = each_cross_product(vectors)
+    return isSameDir(cross_product) ? true : false
+  end
+
+  def isInside(target)
+    if isConvex
+      target_vector = target_vector(target)
+      cross_product = each_cross_product(target_vector)
+      return isSameDir(cross_product) ? 1 : 0
+    end
+
+    return -1
+  end
+
+  protected
+  def sort(p)
+
+    x = y = 0
+    for v in p
+      x += v[0]
+      y += v[1]
+    end
+    avg_dot = [x/@sides, y/@sides]
+
+    arctan = []
+    for v in p
+      arctan << Math.atan2(v[0] - avg_dot[0], v[1] - avg_dot[1])
+    end
+    ind = arctan.map{|e| arctan.sort.index(e)}
+    p = p.sort_by{|x| ind[p.index(x)]}
+    return p
+  end
+
+  def target_vector(target)
+    target_vector = []
+    for v in @vertices
+      target_vector << v - target
+    end
+    return target_vector
+  end
+
+  def each_cross_product(vectors)
+
+    cross_product = []
+    len = vectors.length
+
+    for i in 1..len
+      cross_product << vectors[i-1].cross_product(vectors[i % @sides])
+    end
+
+    return cross_product
+  end
+
+  def isSameDir(cross_product)
+    len = cross_product.length
+    for i in 1..len
+      if cross_product[i-1][2] * cross_product[i % len][2] < 0
+        return false
+      end
+    end
+    return true
+  end
+
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: point-in-polygon
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Even Chang
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-01-09 00:00:00.000000000 Z
+dependencies: []
+description: Determine if a point is inside a polygon with a Sweep Line method
+email: kiki44552002@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/point-in-polygon.rb
+- lib/point-in-polygon/Point.rb
+- lib/point-in-polygon/Polygon.rb
+homepage: http://rubygems.org/gems/point-in-polygon
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: point-in-polygon
+test_files: []