minimal-convex-hull 0.0.3

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: bad9e380dcea4521b6828cee2104ba8390deb43fcbff13b62248de60a42138c9
+  data.tar.gz: 33d51934114a9218a23db4892ccf44a8166838927c86bc61a6440192bf62f7d5
+SHA512:
+  metadata.gz: 1098117452cf5dd98b1ceded1bbd1abc53f0aec1626aeeae08a611b7846822233190638bc0ccb42d2effae9ae84c3f2afdd4676df984748cd92812b25107aa59
+  data.tar.gz: 898759a553f9cda237f2e8d0faead7857b0666a65007a366d8501c745d3603efe5d31e43fb714be00b41522e1831e63d7abbea455242b1c19f345032d50fdcf5

data/lib/minimal-convex-hull-by-Grahem.rb

@@ -0,0 +1,48 @@
+require "point"
+
+class GrahemAlrotithm
+private
+
+  def self.rotate(a, b, c)
+    return (b.x - a.x) * (c.y - b.y) - (b.y - a.y) * (c.x - b.x)
+  end
+
+public
+
+  def self.convex_hull(points)
+    n = points.length
+    if n < 2
+      return points.clone
+    end
+    p = (0...n).to_a
+    for i in 0...n
+      if points[p[i]].x < points[p[0]].x
+        p[i], p[0] = p[0], p[i]
+      end
+    end
+    
+    for i in 2...n
+      j = i
+      while j>1 && (rotate(points[p[0]], points[p[j-1]], points[p[j]])<0) 
+        p[j], p[j-1] = p[j-1], p[j]
+        j -= 1
+      end
+    end
+    
+    s = [p[0], p[1]]
+    for i in 2...n
+      while rotate(points[s[-2]], points[s[-1]], points[p[i]]) < 0
+        s.pop
+      end
+      s << p[i]
+    end
+    
+    result = []
+    for i in 0..s.length-1
+      if not result.include? points[s[i]]
+        result << points[s[i]]
+      end
+    end
+    return result
+  end
+end

data/lib/minimal-convex-hull-by-Jarvis.rb

@@ -0,0 +1,50 @@
+require "point"
+
+class JarvisAlrotithm
+private
+
+  def self.rotate(a, b, c)
+    return (b.x - a.x) * (c.y - b.y) - (b.y - a.y) * (c.x - b.x)
+  end
+
+public
+
+  def self.convex_hull(points)
+    n = points.length
+    if n < 2
+      return points.clone
+    end
+    p = (0...n).to_a
+    for i in 1...n
+      if points[p[i]].x < points[p[0]].x
+        p[i], p[0] = p[0], p[i]
+      end
+    end
+
+    h = [p[0]]
+    p.delete_at(0)
+    p.push(h[0])
+
+    loop do
+      right = 0
+      for i in 1...p.length
+        if rotate(points[h[-1]], points[p[right]], points[p[i]]) < 0
+          right = i
+        end
+      end
+      if p[right] == h[0]
+        break
+      else
+        h.push(p[right])
+        p.delete_at(right)
+      end
+    end
+    result = []
+    for i in 0..h.length-1
+      if not result.include? points[h[i]]
+        result << points[h[i]]
+      end
+    end
+    return result
+  end  
+end

data/lib/minimal-convex-hull.rb

@@ -0,0 +1,3 @@
+require "point"
+require "minimal-convex-hull-by-Grahem"
+require "minimal-convex-hull-by-Jarvis"

data/lib/point.rb

@@ -0,0 +1,31 @@
+class Point
+  attr_accessor :x, :y, :eps
+
+  def initialize(x, y)
+    @x = x
+    @y = y
+    @eps = 0.0001
+  end
+
+  def ==(other)
+    (@x - other.x).abs < eps && (@y - other.y).abs < eps
+  end
+
+  def to_s
+    "(#{@x},#{@y})"
+  end
+
+  def angle_with_origin
+    Math.atan2(@y, @x)
+  end
+
+  def distance_to(other_point)
+    Math.hypot(@x - other_point.x, @y - other_point.y)
+  end
+
+  def orientation(p1, p2)
+    val = (p2.y - p1.y) * (@x - p2.x) - (p2.x - p1.x) * (@y - p2.y)
+    return 0 if val == 0
+    val.positive? ? 1 : 2
+  end
+end

metadata

@@ -0,0 +1,75 @@
+--- !ruby/object:Gem::Specification
+name: minimal-convex-hull
+version: !ruby/object:Gem::Version
+  version: 0.0.3
+platform: ruby
+authors:
+- Mikhail Pokhodeev
+- Konstantin Pinchuk
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2024-06-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
+- !ruby/object:Gem::Dependency
+  name: minitests
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 5.15.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 5.15.0
+description: Grahem's and Jarvis's algorithms finding minimal convex hull
+email: mishapohodeev@yandex.ru
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/minimal-convex-hull-by-Grahem.rb
+- lib/minimal-convex-hull-by-Jarvis.rb
+- lib/minimal-convex-hull.rb
+- lib/point.rb
+homepage: https://github.com/MihailPohodeev/Minimal-Convex-Hull_RUBY-GEM/issues?q=is%3Aissue+is%3Aclosed
+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: []
+rubygems_version: 3.3.15
+signing_key:
+specification_version: 4
+summary: MCH!
+test_files: []