winding-polygon 0.0.3 → 0.0.4

data/lib/winding-polygon/version.rb

@@ -1,3 +1,3 @@
 module WindingPolygon
-    VERSION = "0.0.3"
+    VERSION = "0.0.4"
 end

data/spec/event_queue_spec.rb

@@ -5,8 +5,8 @@ describe "EventQueue" do
   it "test can create an EventQueue" do
 
     points = JSON.parse("[[100.0, 0.0], [101.0, 0.0], [101.0, 1.0], [100.0, 1.0], [100.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
-    event_queue = EventQueue.new(polygon)
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
+    event_queue = WindingPolygon::EventQueue.new(polygon)
 
     event_queue.events.length.should == 8
     event_queue.events.length.should == event_queue.number_of_events

data/spec/point_spec.rb

@@ -3,40 +3,40 @@ require 'spec_helper'
 describe "Point" do
 
   it 'test less than comparator' do
-    p0 = Point.new(1,1)
-    p1 = Point.new(3,3)
+    p0 = WindingPolygon::Point.new(1,1)
+    p1 = WindingPolygon::Point.new(3,3)
     p0.compare(p1).should == -1
   end
 
   it 'test more than comparator' do
-    p0 = Point.new(1,1)
-    p1 = Point.new(3,3)
+    p0 = WindingPolygon::Point.new(1,1)
+    p1 = WindingPolygon::Point.new(3,3)
     p1.compare(p0).should == 1
   end
 
   it 'test equality' do
-    p0 = Point.new(1,1)
+    p0 = WindingPolygon::Point.new(1,1)
     p0.compare(p0).should == 0
   end
 
   it 'test left of line' do
-    p0 = Point.new(1,1)
-    p1 = Point.new(3,3)
-    p2 = Point.new(1,3)
+    p0 = WindingPolygon::Point.new(1,1)
+    p1 = WindingPolygon::Point.new(3,3)
+    p2 = WindingPolygon::Point.new(1,3)
     p2.is_left(p0,p1).should > 0
   end
 
   it 'test right of line' do
-    p0 = Point.new(1,1)
-    p1 = Point.new(3,3)
-    p2 = Point.new(3,1)
+    p0 = WindingPolygon::Point.new(1,1)
+    p1 = WindingPolygon::Point.new(3,3)
+    p2 = WindingPolygon::Point.new(3,1)
     p2.is_left(p0,p1).should < 0
   end
 
   it 'test on of line' do
-    p0 = Point.new(1,1)
-    p1 = Point.new(3,3)
-    p2 = Point.new(2,2)
+    p0 = WindingPolygon::Point.new(1,1)
+    p1 = WindingPolygon::Point.new(3,3)
+    p2 = WindingPolygon::Point.new(2,2)
     p2.is_left(p0,p1).should == 0
   end
 

data/spec/polygon_spec.rb

@@ -5,7 +5,7 @@ describe "Polygon" do
   it 'test can build a polygon from an array of points' do
 
     points = JSON.parse("[[100.0, 0.0], [101.0, 0.0], [101.0, 1.0], [100.0, 1.0], [100.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.vertices.length.should == points.length
     polygon.vertices[0].x.should == points[0][0]
@@ -15,7 +15,7 @@ describe "Polygon" do
   it 'test is polygon simple 1' do
 
     points = JSON.parse("[[100.0, 0.0], [101.0, 0.0], [101.0, 1.0], [100.0, 1.0], [100.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -24,7 +24,7 @@ describe "Polygon" do
   it 'test is polygon simple 2' do
 
     points = JSON.parse("[[2.0, 2.0], [1.0, 2.0], [1.0, 1.0], [2.0, 1.0], [3.0, 1.0], [3.0, 2.0], [2.0, 2.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -33,7 +33,7 @@ describe "Polygon" do
   it 'test is polygon simple 3' do
 
     points = JSON.parse("[[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -42,7 +42,7 @@ describe "Polygon" do
   it 'test is polygon simple 4' do
 
     points = JSON.parse("[[0.0, 0.0], [0.0, 3.0], [3.0, 3.0], [3.0, 0.0], [0.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -51,7 +51,7 @@ describe "Polygon" do
   it 'test is polygon simple 5' do
 
     points = JSON.parse("[[2.0, 2.0], [2.0, 3.0], [3.0, 3.0], [4.0, 3.0], [4.0, 2.0], [2.0, 2.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -60,7 +60,7 @@ describe "Polygon" do
   it 'test is practical polygon simple 6 (clockwise)' do
 
     points = JSON.parse("[[-110.84096146619905, 32.206464264983815],[-110.8254844632264, 32.206404507969239],[-110.82564474991523, 32.2065185890533],[-110.8278203157768, 32.211149692139429],[-110.82920840010047, 32.217701622983441],[110.82990196985523,32.220975019031748],[-110.84096004697494,32.221011891029775],[-110.84096146619905,32.206464264983815]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -69,7 +69,7 @@ describe "Polygon" do
   it 'test is practical polygon simple 7 (counter clockwise)' do
 
     points = JSON.parse("[[-118.845766, 34.013743],[-118.384777,34.013743],[-118.384777, 34.335579],[-118.845766, 34.335579],[-118.845766, 34.013743]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -79,7 +79,7 @@ describe "Polygon" do
   it 'get_intersection_point_hash test for practical polygon simple 6 (clockwise)' do
 
     points = JSON.parse("[[-110.84096146619905, 32.206464264983815],[-110.8254844632264, 32.206404507969239],[-110.82564474991523, 32.2065185890533],[-110.8278203157768, 32.211149692139429],[-110.82920840010047, 32.217701622983441],[110.82990196985523,32.220975019031748],[-110.84096004697494,32.221011891029775],[-110.84096146619905,32.206464264983815]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.get_first_intersection_point_hash.should be_nil
 
@@ -88,7 +88,7 @@ describe "Polygon" do
   it 'get_intersection_point_hash test for practical polygon simple 6 (counter clockwise)' do
 
     points = JSON.parse("[[-118.845766, 34.013743],[-118.384777,34.013743],[-118.384777, 34.335579],[-118.845766, 34.335579],[-118.845766, 34.013743]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.get_first_intersection_point_hash.should be_nil
 
@@ -97,7 +97,7 @@ describe "Polygon" do
   it 'test is practical polygon simple 7 (counter clockwise)' do
 
     points = JSON.parse("[[-118.845766, 34.013743],[-118.384777,34.013743],[-118.384777, 34.335579],[-118.845766, 34.335579],[-118.845766, 34.013743]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == true
 
@@ -107,7 +107,7 @@ describe "Polygon" do
   it 'test is complex polygon 1' do
 
     points = JSON.parse("[[100.0, 0.0],[101.0, 1.0],[100.0, 1.0],[101.0, 0.0], [100.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == false
 
@@ -116,7 +116,7 @@ describe "Polygon" do
   it 'test is complex polygon 2' do
 
     points = JSON.parse("[[2.0, 2.0], [3.0, 2.0], [3.0, 3.0], [4.0, 2.0], [2.0, 2.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == false
 
@@ -125,7 +125,7 @@ describe "Polygon" do
   it 'test is complex polygon 3' do
 
     points = JSON.parse("[[0.0, 0.0], [3.0, 3.0], [0.0, 3.0], [3.0, 0.0], [0.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == false
 
@@ -135,7 +135,7 @@ describe "Polygon" do
   it 'test is practical complex polygon 4' do
 
     points = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-98.4609375000036,40.3051841980949]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     polygon.is_simple.should == false
 
@@ -144,44 +144,44 @@ describe "Polygon" do
   it 'get complex polygon 3 intersection points' do
 
     points = JSON.parse("[[0.0, 0.0], [3.0, 3.0], [0.0, 3.0], [3.0, 0.0], [0.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
-    polygon.get_intersection_points[0].should == Point.new(1.5,1.5)
+    polygon.get_intersection_points[0].should == WindingPolygon::Point.new(1.5,1.5)
 
   end
 
   it 'get practical complex polygon 4 intersection points' do
 
     points = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-98.4609375000036,40.3051841980949]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
-    polygon.get_intersection_points[0].should == Point.new(-97.39951856124108,38.97265129300353)
+    polygon.get_intersection_points[0].should == WindingPolygon::Point.new(-97.39951856124108,38.97265129300353)
 
   end
 
   it 'get_intersection_point_hash test for practical complex polygon' do
 
     points = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-98.4609375000036,40.3051841980949]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
-    polygon.get_first_intersection_point_hash.should == {:point=>Point.new(-97.39951856124108,38.97265129300353),:edge1=>1,:edge2=>3 }
+    polygon.get_first_intersection_point_hash.should == {:point=>WindingPolygon::Point.new(-97.39951856124108,38.97265129300353),:edge1=>1,:edge2=>3 }
 
   end
 
   it 'should decompose a practical complex polygon into two simple polygons' do
 
     points = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-98.4609375000036,40.3051841980949]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     multi_polygons = polygon.decompose
     multi_polygons.should_not be_nil
 
     points1 = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-97.39951856124108,38.97265129300353],[-98.4609375000036,40.3051841980949]]")
-    polygon1 = Polygon.new(points1.map{|item| Point.new(item[0],item[1])})
+    polygon1 = WindingPolygon::Polygon.new(points1.map{|item| WindingPolygon::Point.new(item[0],item[1])})
     multi_polygons[0].should ==polygon1
 
     points2 = JSON.parse("[[-97.39951856124108,38.97265129300353],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-97.39951856124108,38.97265129300353]]")
-    polygon2 = Polygon.new(points2.map{|item| Point.new(item[0],item[1])})
+    polygon2 = WindingPolygon::Polygon.new(points2.map{|item| WindingPolygon::Point.new(item[0],item[1])})
     multi_polygons[1].should ==polygon2
 
   end

data/spec/segment_spec.rb

@@ -4,13 +4,13 @@ describe "Segment" do
 
   it "test_segments_intersect_at_the_endpoint" do
 
-      segment1 = Segment.new({:edge=>0})
-      segment1.left_point = Point.new(0,0)
-      segment1.right_point = Point.new(2,2)
+      segment1 = WindingPolygon::Segment.new({:edge=>0})
+      segment1.left_point = WindingPolygon::Point.new(0,0)
+      segment1.right_point = WindingPolygon::Point.new(2,2)
 
-      segment2 = Segment.new({:edge=>1})
-      segment2.left_point = Point.new(0,2)
-      segment2.right_point = Point.new(2,2)
+      segment2 = WindingPolygon::Segment.new({:edge=>1})
+      segment2.left_point = WindingPolygon::Point.new(0,2)
+      segment2.right_point = WindingPolygon::Point.new(2,2)
 
       intersection_point = segment1.intersection_point_with(segment2)
       intersection_point.x.should ==2

data/spec/sweep_line_spec.rb

@@ -4,9 +4,9 @@ describe "SweepLine" do
 
   it "test can find" do
     points = JSON.parse("[[100.0, 0.0], [101.0, 0.0], [101.0, 1.0], [100.0, 1.0], [100.0, 0.0]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
-    sweep_line = SweepLine.new(polygon)
-    event_queue = EventQueue.new(polygon)
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
+    sweep_line = WindingPolygon::SweepLine.new(polygon)
+    event_queue = WindingPolygon::EventQueue.new(polygon)
 
     event = event_queue.events.pop
     while !event.nil?

data/spec/winding-polygon_spec.rb

@@ -8,18 +8,18 @@ describe WindingPolygon do
   it 'should decompose a practical complex polygon into two simple polygons' do
 
     points = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-98.4609375000036,40.3051841980949]]")
-    polygon = Polygon.new(points.map{|item| Point.new(item[0],item[1])})
+    polygon = WindingPolygon::Polygon.new(points.map{|item| WindingPolygon::Point.new(item[0],item[1])})
 
     multi_polygons = []
     WindingPolygon.decompose(polygon,multi_polygons)
     multi_polygons.should_not be_nil
 
     points1 = JSON.parse("[[-98.4609375000036,40.3051841980949],[-98.4609375000036,38.057277897745],[-97.39951856124108,38.97265129300353],[-98.4609375000036,40.3051841980949]]")
-    polygon1 = Polygon.new(points1.map{|item| Point.new(item[0],item[1])})
+    polygon1 = WindingPolygon::Polygon.new(points1.map{|item| WindingPolygon::Point.new(item[0],item[1])})
     multi_polygons[0].should ==polygon1
 
     points2 = JSON.parse("[[-97.39951856124108,38.97265129300353],[-96.0878906250017,40.1038062719331],[-96.6152343750031,37.9880405545487],[-97.39951856124108,38.97265129300353]]")
-    polygon2 = Polygon.new(points2.map{|item| Point.new(item[0],item[1])})
+    polygon2 = WindingPolygon::Polygon.new(points2.map{|item| WindingPolygon::Point.new(item[0],item[1])})
     multi_polygons[1].should ==polygon2
 
   end

data/test/test_avltree.rb

@@ -9,13 +9,13 @@ class TestAVLTree < Test::Unit::TestCase
     #     1     4
     #          3 5
     #
-    @tree = AVLTree.new [1,2,5,4,3]
+    @tree = WindingPolygon::AVLTree.new [1,2,5,4,3]
     #
     #          4
     #      2       6
     #     1 3     5 7
     #
-    @rot_tree = AVLTree.new [4,2,6,3,1,5,7]
+    @rot_tree = WindingPolygon::AVLTree.new [4,2,6,3,1,5,7]
   end
 
   def test_sort

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: winding-polygon
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Martin Xu
@@ -28,31 +28,31 @@ dependencies:
   name: test-unit
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
-description: ! 'Use Bentley-Ottmann algorithm to solve self-intersecting polygon issue '
+description: 'Use Bentley-Ottmann algorithm to solve self-intersecting polygon issue '
 email:
 - mxu2008@gmail.com
 executables: []
@@ -92,17 +92,17 @@ 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.0.3
+rubygems_version: 2.0.0
 signing_key: 
 specification_version: 4
 summary: Detect intersecting points and decompose it into multi-polygons