delaunator 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: ba1fa13db2ec7a62c745e00d5778eb22ba26c07ae2b4d7766ec7d35a0a93da73
+  data.tar.gz: 32c5d8eaada41b5b2b5d51848227def3b2e4fba70523a5b98f7e8225fb712ddd
+SHA512:
+  metadata.gz: 5df303e21a1b177a2365b00c4e6e004a4d647a4157c4fa7ed4487f5d1dae671e07b2aa3b14ca1b9d6fd2560f57fe2bfe71aedd7bb8e97b11232d5c15e4010e34
+  data.tar.gz: 51ab346370f54f2362d227cce4e516b96d195e5ef794b1798242c8ffb9c817cc34452f762350106a863eeab0c1f9b95d93f6bc497958f884b188bf3fb9bf944a

data/.gitignore

@@ -0,0 +1,13 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+Gemfile.lock
+.rspec
+
+# rspec failure tracking
+.rspec_status

data/.travis.yml

@@ -0,0 +1,7 @@
+---
+sudo: false
+language: ruby
+cache: bundler
+rvm:
+  - 2.6.5
+before_install: gem install bundler -v 2.0.2

data/Gemfile

@@ -0,0 +1,4 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in delaunator-ruby.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2019 Wolfgang Wohanka
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,39 @@
+# Delaunay Triangulation
+
+This is a port of [Mapbox's Delaunator project](https://github.com/mapbox/delaunator).
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'delaunator'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install delaunator
+
+## Usage
+
+```ruby
+Delaunator.triangulate([[516, 661], [369, 793], [426, 539]...])
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/hendrixfan/delaunator-ruby.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "delaunator"
+require 'yaml'
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+require "pry"
+Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/delaunator.gemspec

@@ -0,0 +1,32 @@
+lib = File.expand_path("lib", __dir__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "delaunator"
+
+Gem::Specification.new do |spec|
+  spec.name          = "delaunator"
+  spec.version       = Delaunator::VERSION
+  spec.authors       = ["Wolfgang Wohanka"]
+  spec.email         = ["wolfgang.wohanka@gmail.com"]
+
+  spec.summary       = "Delaunay triangulation of 2D points"
+  spec.description   = "Delaunay triangulation of 2D points"
+  spec.homepage      = 'https://github.com/hendrixfan/delaunator-ruby'
+  spec.license       = "MIT"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = 'https://github.com/hendrixfan/delaunator-ruby'
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 2.0"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "pry", "~> 0.12.2"
+end

data/fixtures/ukraine.yml

@@ -0,0 +1 @@
+[[168, 180], [168, 178], [168, 179], [168, 181], [168, 183], [167, 183], [167, 184], [165, 184], [162, 186], [164, 188], [161, 188], [160, 191], [158, 193], [156, 193], [152, 195], [152, 198], [150, 198], [147, 198], [148, 205], [150, 210], [148, 210], [148, 208], [145, 206], [142, 206], [140, 206], [138, 206], [135, 206], [135, 209], [131, 209], [131, 211], [127, 211], [124, 210], [120, 207], [120, 204], [120, 202], [124, 201], [123, 201], [125, 198], [125, 194], [127, 194], [127, 191], [130, 191], [132, 189], [134, 189], [134, 186], [136, 184], [134, 182], [134, 179], [134, 176], [136, 174], [139, 174], [141, 177], [142, 176], [144, 176], [147, 178], [148, 176], [151, 178], [154, 178], [153, 175], [152, 174], [152, 170], [152, 168], [150, 166], [148, 166], [147, 165], [145, 162], [146, 160], [146, 157], [146, 155], [144, 155], [142, 152], [140, 150], [138, 150], [138, 148], [140, 145], [140, 142], [140, 138], [139, 138], [137, 138], [135, 138], [133, 135], [132, 132], [129, 132], [128, 132], [124, 132], [124, 130], [123, 130], [118, 126], [116, 124], [112, 122], [109, 122], [105, 122], [102, 124], [100, 124], [97, 124], [95, 126], [92, 127], [89, 127], [88, 130], [85, 132], [80, 134], [72, 134], [69, 134], [65, 138], [64, 138], [58, 137], [56, 133], [52, 133], [51, 133], [48, 133], [44, 133], [41, 131], [38, 130], [35, 130], [32, 127], [30, 127], [27, 127], [24, 127], [24, 126], [23, 124], [20, 122], [17, 122], [16, 118], [15, 116], [15, 110], [18, 108], [20, 102], [24, 97], [28, 102], [28, 98], [26, 97], [28, 94], [27, 85], [29, 79], [32, 76], [39, 70], [44, 66], [48, 65], [53, 61], [53, 58], [51, 54], [54, 54], [52, 48], [51, 43], [48, 42], [49, 38], [48, 34], [51, 30], [53, 33], [58, 30], [61, 30], [60, 27], [64, 26], [68, 24], [74, 24], [80, 24], [85, 26], [92, 26], [96, 29], [103, 32], [109, 33], [112, 37], [116, 37], [120, 37], [124, 35], [126, 35], [128, 38], [132, 38], [134, 41], [138, 38], [140, 36], [142, 40], [144, 43], [145, 41], [149, 41], [155, 41], [159, 41], [161, 46], [165, 46], [164, 42], [164, 39], [164, 34], [167, 30], [173, 24], [178, 24], [184, 24], [189, 26], [195, 21], [195, 20], [199, 20], [203, 20], [207, 17], [211, 17], [216, 17], [218, 16], [222, 22], [225, 27], [228, 31], [226, 34], [224, 34], [226, 39], [228, 43], [230, 46], [236, 46], [242, 46], [243, 50], [245, 50], [247, 54], [247, 56], [248, 60], [248, 65], [253, 66], [255, 64], [260, 64], [264, 67], [268, 71], [272, 66], [275, 66], [281, 61], [285, 66], [286, 70], [292, 74], [294, 74], [296, 74], [296, 71], [301, 74], [307, 74], [311, 78], [315, 74], [315, 77], [319, 77], [322, 82], [328, 82], [331, 81], [331, 84], [333, 86], [333, 90], [330, 95], [326, 98], [328, 99], [332, 98], [333, 101], [331, 104], [329, 104], [327, 106], [329, 111], [332, 116], [333, 119], [333, 122], [332, 126], [332, 130], [327, 130], [321, 130], [317, 130], [315, 134], [312, 134], [308, 138], [306, 138], [306, 144], [306, 149], [306, 152], [301, 152], [297, 154], [295, 154], [292, 154], [292, 158], [288, 158], [283, 162], [281, 164], [279, 163], [276, 163], [273, 166], [272, 169], [268, 168], [265, 170], [260, 172], [256, 176], [252, 176], [248, 181], [246, 182], [246, 189], [246, 194], [248, 197], [250, 198], [252, 200], [252, 203], [254, 205], [260, 205], [264, 202], [267, 202], [269, 202], [272, 199], [280, 199], [278, 202], [278, 207], [278, 211], [276, 211], [272, 213], [268, 213], [265, 213], [264, 211], [262, 210], [260, 210], [257, 212], [257, 214], [255, 217], [253, 217], [253, 221], [249, 220], [247, 220], [243, 222], [240, 223], [239, 226], [234, 231], [229, 231], [224, 231], [219, 227], [220, 227], [222, 224], [222, 222], [222, 219], [224, 217], [222, 214], [220, 212], [217, 210], [215, 210], [211, 209], [208, 206], [202, 209], [202, 205], [206, 202], [211, 198], [216, 195], [220, 192], [224, 192], [221, 186], [218, 186], [214, 185], [208, 185], [204, 186], [200, 186], [193, 183], [190, 182], [188, 182], [190, 178], [186, 178], [184, 174], [182, 171], [178, 171], [173, 174], [169, 174], [169, 175], [169, 179], [167, 182], [164, 186], [160, 192], [155, 195], [152, 198], [150, 198], [148, 198], [148, 202], [151, 208], [148, 210], [146, 208], [144, 205], [140, 205], [137, 208], [132, 208], [132, 210], [127, 210], [124, 210], [120, 206], [120, 202], [123, 202], [124, 201], [124, 198], [128, 195], [131, 191], [133, 187], [135, 183], [130, 203], [129, 208], [123, 203], [129, 203], [129, 198], [133, 198], [136, 200], [142, 200], [143, 199], [143, 197], [137, 196], [136, 194], [133, 194], [136, 186], [136, 182], [141, 186], [144, 186], [150, 186], [150, 190], [155, 190], [159, 188], [156, 182], [151, 182], [144, 182], [164, 176], [161, 177], [157, 177], [166, 176], [168, 165], [175, 167], [180, 167], [188, 159], [195, 164], [195, 162], [187, 162], [178, 163], [173, 166], [168, 170], [156, 170], [157, 165], [164, 165], [164, 161], [170, 159], [167, 158], [159, 154], [149, 151], [145, 145], [145, 138], [152, 138], [152, 146], [159, 146], [165, 153], [176, 153], [180, 153], [187, 153], [194, 153], [202, 153], [202, 158], [197, 158], [193, 158], [193, 142], [180, 142], [171, 142], [163, 135], [176, 135], [186, 139], [201, 139], [206, 139], [205, 147], [205, 160], [198, 160], [206, 174], [205, 178], [196, 178], [196, 182], [202, 182], [206, 181], [209, 181], [215, 181], [222, 181], [230, 177], [238, 175], [241, 175], [237, 175], [237, 168], [237, 161], [232, 156], [231, 162], [225, 166], [217, 169], [210, 173], [224, 173], [227, 173], [235, 175], [237, 178], [228, 192], [222, 199], [216, 199], [211, 204], [205, 206], [219, 207], [222, 211], [229, 214], [236, 214], [244, 211], [247, 211], [268, 206], [277, 201], [279, 201], [281, 202], [278, 202], [242, 178], [236, 170], [236, 162], [255, 162], [251, 156], [240, 156], [253, 152], [261, 152], [277, 157], [268, 151], [255, 143], [260, 142], [267, 145], [271, 149], [273, 154], [258, 146], [257, 131], [256, 134], [248, 137], [260, 137], [260, 134], [271, 137], [276, 138], [276, 144], [289, 144], [285, 150], [294, 150], [298, 149], [301, 145], [292, 145], [282, 134], [276, 134], [283, 127], [282, 116], [277, 113], [283, 113], [288, 106], [296, 106], [297, 113], [297, 118], [298, 118], [310, 122], [310, 128], [300, 130], [300, 140], [292, 129], [292, 114], [283, 122], [289, 122], [299, 122], [299, 134], [294, 134], [288, 124], [314, 121], [311, 113], [308, 110], [304, 96], [299, 90], [299, 82], [305, 87], [309, 94], [311, 101], [312, 102], [314, 107], [320, 112], [320, 115], [326, 116], [323, 109], [321, 102], [321, 94], [321, 90], [328, 90], [328, 88], [316, 88], [316, 84], [307, 84], [290, 77], [289, 88], [289, 97], [278, 97], [268, 106], [268, 110], [261, 105], [255, 103], [244, 103], [252, 100], [252, 91], [252, 82], [242, 78], [252, 78], [259, 78], [264, 87], [267, 92], [272, 91], [272, 83], [264, 83], [260, 79], [276, 79], [283, 84], [283, 94], [289, 94], [284, 86], [272, 77], [253, 110], [248, 110], [239, 110], [234, 114], [222, 125], [219, 127], [219, 131], [219, 138], [219, 141], [224, 139], [224, 135], [225, 130], [232, 136], [240, 138], [237, 131], [237, 118], [248, 120], [256, 122], [262, 127], [255, 118], [245, 110], [207, 129], [199, 134], [195, 134], [188, 130], [180, 130], [165, 129], [156, 129], [165, 128], [173, 125], [185, 126], [193, 126], [201, 124], [204, 123], [208, 116], [214, 114], [207, 114], [196, 114], [183, 121], [183, 111], [189, 117], [196, 112], [172, 126], [164, 126], [159, 114], [174, 106], [186, 106], [192, 105], [184, 105], [184, 96], [173, 96], [163, 111], [159, 110], [152, 110], [168, 110], [171, 106], [183, 98], [193, 101], [219, 96], [225, 97], [225, 104], [232, 92], [240, 92], [237, 86], [229, 86], [216, 88], [214, 79], [203, 79], [203, 75], [212, 75], [221, 75], [229, 80], [230, 89], [217, 88], [217, 77], [228, 77], [228, 69], [235, 71], [240, 71], [244, 66], [236, 54], [236, 62], [232, 68], [229, 61], [216, 61], [212, 58], [212, 47], [212, 39], [214, 28], [215, 48], [225, 55], [236, 55], [202, 65], [202, 54], [202, 44], [202, 24], [198, 32], [199, 38], [192, 38], [185, 38], [174, 42], [174, 48], [178, 51], [184, 51], [194, 55], [191, 68], [182, 68], [174, 69], [167, 67], [153, 59], [153, 49], [147, 49], [152, 58], [152, 74], [154, 83], [161, 83], [165, 88], [153, 97], [153, 89], [152, 82], [168, 88], [168, 101], [156, 102], [156, 119], [173, 110], [184, 110], [177, 106], [160, 106], [145, 125], [137, 122], [131, 120], [124, 120], [122, 118], [113, 118], [114, 111], [129, 111], [140, 110], [143, 106], [137, 102], [127, 102], [119, 98], [126, 93], [139, 93], [139, 99], [141, 95], [128, 89], [118, 74], [128, 76], [135, 76], [141, 83], [141, 71], [137, 61], [137, 50], [129, 50], [118, 50], [109, 52], [112, 61], [123, 60], [134, 60], [129, 76], [121, 67], [124, 76], [123, 76], [111, 74], [128, 73], [109, 83], [109, 94], [105, 103], [102, 118], [92, 113], [98, 105], [99, 93], [94, 93], [94, 81], [99, 81], [100, 73], [100, 89], [100, 60], [100, 55], [105, 37], [101, 34], [93, 37], [90, 37], [90, 49], [99, 49], [88, 68], [80, 68], [78, 64], [88, 62], [86, 77], [76, 89], [71, 91], [71, 106], [78, 106], [82, 118], [84, 110], [71, 104], [76, 103], [76, 91], [78, 83], [85, 89], [83, 103], [83, 119], [76, 130], [62, 130], [68, 127], [74, 126], [83, 123], [62, 123], [56, 123], [59, 129], [59, 120], [49, 110], [46, 106], [56, 100], [62, 94], [62, 109], [72, 112], [67, 112], [57, 112], [61, 122], [60, 102], [52, 125], [44, 121], [36, 114], [32, 110], [20, 110], [22, 118], [35, 118], [44, 124], [32, 119], [22, 111], [44, 96], [36, 106], [36, 94], [32, 94], [35, 83], [44, 91], [52, 91], [52, 80], [59, 80], [62, 76], [62, 70], [47, 78], [55, 75], [64, 71], [64, 60], [58, 53], [58, 43], [65, 43], [65, 60], [76, 52], [73, 38], [76, 36], [93, 48], [89, 39], [99, 40], [98, 50], [94, 63], [117, 63], [131, 67], [131, 74], [142, 78], [140, 61], [124, 58], [124, 48], [136, 55], [236, 200], [228, 200], [226, 192], [232, 198], [238, 210], [248, 210], [236, 220], [230, 223], [230, 213], [175, 32], [172, 32], [171, 38], [184, 30]]

data/lib/delaunator.rb

@@ -0,0 +1,54 @@
+require 'delaunator/version'
+require 'delaunator/triangulator'
+
+module Delaunator
+  def self.triangulate(points)
+    coords = points.flatten
+    Delaunator::Triangulator.new(coords).triangulate
+  end
+
+  def self.validate(points)
+    coords = points.flatten
+    d = Delaunator::Triangulator.new(coords)
+    d.triangulate
+    (0..d.halfedges.length - 1).each do |i|
+      i2 = d.halfedges[i]
+      #if i2 != -1 && d.halfedges[i2] != i
+      raise ArgumentError, "invalid_halfedge #{i}" if i2 != -1 && d.halfedges[i2] != i
+    end
+    # validate triangulation
+    hull_areas = []
+    len = d.hull.length
+    j = len - 1
+    (0..j).each do |i|
+      start_point = points[d.hull[j]]
+      end_point = points[d.hull[i]]
+      hull_areas << ((end_point.first - start_point.first) * (end_point.last + start_point.last))
+      c = convex(points[d.hull[j]], points[d.hull[(j + 1) % d.hull.length]],  points[d.hull[(j + 3) % d.hull.length]])
+      j = i - 1
+      raise ArgumentError, :not_convex unless c
+    end
+    hull_area = hull_areas.inject(0){ |sum, x| sum + x }
+
+    triangle_areas = []
+    (0..d.triangles.length-1).step(10) do |i|
+      ax, ay = points[d.triangles[i]]
+      bx, by = points[d.triangles[i + 1]]
+      cx, cy = points[d.triangles[i + 2]]
+      triangle_areas << ((by - ay) * (cx - bx) - (bx - ax) * (cy - by)).abs
+    end
+    triangles_area = triangle_areas.inject(0){ |sum, x| sum + x }
+    err = ((hull_area - triangles_area) / hull_area).abs
+    raise ArgumentError, :invalid_triangulation unless err <= 2.pow(-51)
+  end
+
+  def self.convex(r, q, p)
+    (orient(p, r, q) || orient(r, q, p) || orient(q, p, r)) >= 0
+  end
+
+  def self.orient((px, py), (rx, ry), (qx, qy))
+    l = (ry - py) * (qx - px)
+    r = (rx - px) * (qy - py)
+    ((l - r).abs >= 3.3306690738754716e-16 * (l + r).abs) ? l - r : 0;
+  end
+end

data/lib/delaunator/triangulator.rb

@@ -0,0 +1,431 @@
+module Delaunator
+  class Triangulator
+    attr_reader :halfedges, :hull, :triangles, :coords
+
+    EPSILON = 2.pow(-52)
+
+    EDGE_STACK = Array.new(512, 0)
+
+    def initialize(coords)
+      @coords = coords
+      @n = @coords.length >> 1
+      @max_triangles = [2 * @n - 5, 0].max
+      @triangles_len = 0
+      @triangles = Array.new(@max_triangles * 3, 0)
+      @halfedges = Array.new(@max_triangles * 3, 0)
+
+      @hash_size = Math.sqrt(@n).ceil
+      @hull_prev = Array.new(@n, 0)
+      @hull_next = Array.new(@n, 0)
+      @hull_tri = Array.new(@n, 0)
+      @hull_hash = Array.new(@hash_size, -1)
+    end
+
+    def triangulate
+      dists = Array.new(@n, 0.0)
+      ids = Array.new(@n, 0)
+      min_x = Float::INFINITY
+      min_y = Float::INFINITY
+      max_x = -Float::INFINITY
+      max_y = -Float::INFINITY
+      # compute bounds
+      (0..@n - 1).each do |i|
+        x = @coords[2 * i]
+        y = @coords[2 * i + 1]
+        min_x = x if x < min_x
+        min_y = y if y < min_y
+        max_x = x if x > max_x
+        max_y = y if y > max_y
+      end
+
+      cx = (min_x + max_x).to_f / 2
+      cy = (min_y + max_y).to_f / 2
+      min_dist = Float::INFINITY
+      i0 = 0
+      i1 = 0
+      i2 = 0
+
+      # pick a seed point close to midpoint i0
+      (0..@n - 1).each do |i|
+        d = dist(cx, cy, @coords[2 * i], @coords[2 * i + 1])
+        if d < min_dist
+          i0 = i
+          min_dist = d
+        end
+      end
+      i0x = @coords[2 * i0]
+      i0y = @coords[2 * i0 + 1]
+
+      min_dist = Float::INFINITY
+
+      (0..@n - 1).each do |i|
+        next if i == i0
+
+        d = dist(i0x, i0y, @coords[2 * i], @coords[2 * i + 1])
+        if (d < min_dist) && (d > 0)
+          i1 = i
+          min_dist = d
+        end
+      end
+      i1x = @coords[2 * i1]
+      i1y = @coords[2 * i1 + 1]
+
+      min_radius = Float::INFINITY
+
+      # find the third point which forms the smallest circumcircle with the first two
+
+      (0..@n - 1).each do |i|
+        next if (i == i0) || (i == i1)
+
+        r = circumradius(i0x, i0y, i1x, i1y, @coords[2 * i], @coords[2 * i + 1])
+        if r < min_radius
+          i2 = i
+          min_radius = r
+        end
+      end
+
+      i2x = @coords[2 * i2]
+      i2y = @coords[2 * i2 + 1]
+      if min_radius == Float::INFINITY
+        # order collinear points by dx (or dy if all x are identical)
+        # and return the list as a hull
+        (0..n - 1).each do |i|
+          dists[i] = (@coords[2 * i] - @coords[0]) || (@coords[2 * i + 1] - @coords[1])
+        end
+        ids = dists.map.with_index.sort.map(&:last)
+        @hull = Array.new(@n, 0)
+        j = 0
+        d0 = -Float::INFINITY
+        (0..@n - 1).each do |i|
+          id = ids[i]
+          next unless dists[id] > d0
+
+          @hull[j] = id
+          j += 1
+          d0 = dists[id]
+        end
+        @hull = hull.slice(0, j)
+        @triangles = []
+        @halfedges = []
+        return
+      end
+
+      # swap the order of the seed points for counter-clockwise orientation
+      if orient(i0x, i0y, i1x, i1y, i2x, i2y)
+        i = i1
+        x = i1x
+        y = i1y
+        i1 = i2
+        i1x = i2x
+        i1y = i2y
+        i2 = i
+        i2x = x
+        i2y = y
+      end
+      center = circumcenter(i0x, i0y, i1x, i1y, i2x, i2y)
+      @cx, @cy = center
+
+      (0..@n - 1).each do |k|
+        dists[k] = dist(@coords[2 * k], @coords[2 * k + 1], center[0], center[1])
+      end
+      # sort the points by distance from the seed triangle circumcenter
+      ids = dists.map.with_index.sort.map(&:last)
+
+      @hull_start = i0
+      @hull_size = 3
+
+      @hull_next[i0] = @hull_prev[i2] = i1
+      @hull_next[i1] = @hull_prev[i0] = i2
+      @hull_next[i2] = @hull_prev[i1] = i0
+
+      @hull_tri[i0] = 0
+      @hull_tri[i1] = 1
+      @hull_tri[i2] = 2
+
+      @hull_hash.fill(-1)
+      @hull_hash[hash_key(i0x, i0y)] = i0
+      @hull_hash[hash_key(i1x, i1y)] = i1
+      @hull_hash[hash_key(i2x, i2y)] = i2
+
+      @triangles_len = 0
+      add_triangle(i0, i1, i2, -1, -1, -1)
+      xp = 0
+      yp = 0
+      (0..ids.length - 1).each do |k|
+        i = ids[k]
+        x = @coords[2 * i]
+        y = @coords[2 * i + 1]
+        if (k > 0 && (x - xp).abs <= EPSILON && (y - yp).abs <= EPSILON)
+          next
+        end
+        xp = x
+        yp = y
+        #skip seed triangle points
+        if i == i0 || i == i1 || i == i2
+          next
+        end
+        # find a visible edge on the convex hull using edge hash
+
+        start = 0
+
+        key = hash_key(x, y)
+        (0..@hash_size - 1).each do |m|
+          start = @hull_hash[(key + m) % @hash_size]
+          break if (start != -1) && (start != @hull_next[start])
+        end
+        start = @hull_prev[start]
+        e = start
+        q = nil
+        loop do
+          q = @hull_next[e]
+          break if orient(x, y, @coords[2 * e], @coords[2 * e + 1], @coords[2 * q], @coords[2 * q + 1])
+          e = q
+          if e == start
+            e = -1
+            break
+          end
+        end
+
+        if e == -1
+          next
+        end
+        t = add_triangle(e, i, @hull_next[e], -1, -1, @hull_tri[e])
+        @hull_tri[i] = legalize(t + 2)
+        @hull_tri[e] = t
+        @hull_size += 1
+        n = @hull_next[e]
+        loop do
+          q = @hull_next[n]
+          break if !orient(x, y, @coords[2 * n], @coords[2 * n + 1], @coords[2 * q], @coords[2 * q + 1])
+          t = add_triangle(n, i, q, @hull_tri[i], -1, @hull_tri[n])
+          @hull_tri[i] = legalize(t + 2)
+          @hull_next[n] = n
+          @hull_size -= 1
+          n = q
+        end
+
+        if e == start
+          loop do
+            q = @hull_prev[e]
+            break if !orient(x, y, @coords[2 * q], @coords[2 * q + 1], @coords[2 * e], @coords[2 * e + 1])
+
+            t = add_triangle(q, i, e, -1, @hull_tri[e], @hull_tri[q])
+
+            legalize(t + 2)
+            @hull_tri[q] = t
+            @hull_next[e] = e
+            @hull_size -= 1
+            e = q
+          end
+        end
+        @hull_start = e
+        @hull_prev[i] = e
+        @hull_next[e] = i
+        @hull_prev[n] = i
+        @hull_next[i] = n
+
+        # save the two new edges in the hash table
+        # this._hashKey(x, y) = 0 FEHLER
+        @hull_hash[hash_key(x, y)] = i
+        @hull_hash[hash_key(@coords[2 * e], @coords[2 * e + 1])] = e
+      end
+      @hull = Array.new(@hull_size, 0)
+      e = @hull_start
+      (0..@hull_size - 1).each do |k|
+        @hull[k] = e
+        e = @hull_next[e]
+      end
+
+      # trim typed triangle mesh arrays
+      @triangles = @triangles.slice(0, @triangles_len)
+      @halfedges = @halfedges.slice(0, @triangles_len)
+    end
+
+    def dist(ax, ay, bx, by)
+      dx = ax - bx
+      dy = ay - by
+      dx * dx + dy * dy
+    end
+
+    # return 2d orientation sign if we're confident in it through J. Shewchuk's error bound check
+    def orient_if_sure(px, py, rx, ry, qx, qy)
+      l = (ry - py) * (qx - px)
+      r = (rx - px) * (qy - py)
+      ((l - r).abs >= (3.3306690738754716e-16 * (l + r).abs)) ? l - r : 0
+    end
+
+    # a more robust orientation test that's stable in a given triangle (to fix robustness issues)
+    def orient(rx, ry, qx, qy, px, py)
+      (orient_if_sure(px, py, rx, ry, qx, qy) || orient_if_sure(rx, ry, qx, qy, px, py) || orient_if_sure(qx, qy, px, py, rx, ry)) < 0
+    end
+
+    def circumcenter(ax, ay, bx, by, cx, cy)
+      dx = bx - ax
+      dy = by - ay
+      ex = cx - ax
+      ey = cy - ay
+
+      bl = dx * dx + dy * dy
+      cl = ex * ex + ey * ey
+      d = 0.5 / ( dx * ey - dy * ex).to_f
+
+      x = ax + (ey * bl - dy * cl) * d
+      y = ay + (dx * cl - ex * bl) * d
+      [x, y]
+    end
+
+    def circumradius(ax, ay, bx, by, cx, cy)
+      dx = bx - ax
+      dy = by - ay
+      ex = cx - ax
+      ey = cy - ay
+
+      bl = dx * dx + dy * dy
+      cl = ex * ex + ey * ey
+      d = 0.5 / (dx * ey - dy * ex).to_f
+
+      x = (ey * bl - dy * cl) * d
+      y = (dx * cl - ex * bl) * d
+
+      r = x * x + y * y
+
+      return 0 if [bl, cl, d, r].include? 0
+
+      r
+    end
+
+    def in_circle(ax, ay, bx, by, cx, cy, px, py)
+      dx = ax - px
+      dy = ay - py
+      ex = bx - px
+      ey = by - py
+      fx = cx - px
+      fy = cy - py
+
+      ap = dx * dx + dy * dy
+      bp = ex * ex + ey * ey
+      cp = fx * fx + fy * fy
+
+      (
+        dx * (ey * cp - bp * fy) -
+        dy * (ex * cp - bp * fx) +
+        ap * (ex * fy - ey * fx)
+      ) < 0
+    end
+
+    def pseudo_angle(dx, dy)
+      p = dx / (dx.abs + dy.abs).to_f
+      (dy > 0 ? 3 - p : 1 + p) / 4.to_f
+    end
+
+    def add_triangle(i0, i1, i2, a, b, c)
+      i = @triangles_len
+      @triangles[i] = i0
+      @triangles[i + 1] = i1
+      @triangles[i + 2] = i2
+      link(i, a)
+      link(i + 1, b)
+      link(i + 2, c)
+      @triangles_len += 3
+      i
+    end
+
+    def hash_key(x, y)
+      angle = (pseudo_angle(x - @cx, y - @cy) * @hash_size).floor()
+      angle % @hash_size
+    end
+
+    def link(a, b)
+      @halfedges[a] = b
+      @halfedges[b] = a if b != -1
+    end
+
+    def legalize(a)
+      # if the pair of triangles doesn't satisfy the Delaunay condition
+      # (p1 is inside the circumcircle of [p0, pl, pr]), flip them,
+      # then do the same check/flip recursively for the new pair of triangles
+      #
+      #           pl                    pl
+      #          /||\                  /  \
+      #       al/ || \bl            al/    \a
+      #        /  ||  \              /      \
+      #       /  a||b  \    flip    /___ar___\
+      #     p0\   ||   /p1   =>   p0\---bl---/p1
+      #        \  ||  /              \      /
+      #       ar\ || /br             b\    /br
+      #          \||/                  \  /
+      #           pr                    pr
+      i = 0
+      ar = 0
+      loop do
+        b = @halfedges[a]
+        a0 = a - a % 3
+
+        ar = a0 + (a + 2) % 3
+        # convex hull edge
+        if b == -1
+          break if i.zero?
+          i -= 1
+          a = EDGE_STACK[i]
+          next
+        end
+
+        b0 = b - b % 3
+        al = a0 + (a + 1) % 3
+        bl = b0 + (b + 2) % 3
+
+        p0 = @triangles[ar]
+        pr = @triangles[a]
+        pl = @triangles[al]
+        p1 = @triangles[bl]
+
+        illegal = in_circle(@coords[2 * p0], @coords[2 * p0 + 1],
+                            @coords[2 * pr], @coords[2 * pr + 1],
+                            @coords[2 * pl], @coords[2 * pl + 1],
+                            @coords[2 * p1], @coords[2 * p1 + 1])
+
+        if illegal
+          @triangles[a] = p1
+          @triangles[b] = p0
+          hbl = @halfedges[bl]
+          # edge swapped on the other side of the hull (rare)
+          # fix the halfedge reference
+          if hbl == -1
+            e = @hull_start
+            loop do
+              if @hull_tri[e] == bl
+                @hull_tri[e] = a
+                break
+              end
+              e = @hull_prev[e]
+              break if e != @hull_start
+            end
+          end
+          link(a, hbl)
+          link(b, @halfedges[ar])
+          link(ar, bl)
+
+          br = b0 + (b + 1) % 3
+
+          if i < EDGE_STACK.length
+            EDGE_STACK[i] = br
+            i += 1
+          end
+        else
+          break if i.zero?
+
+          i -= 1
+          a = EDGE_STACK[i]
+        end
+      end
+      ar
+    end
+  end
+end
+
+class Array
+  def swap!(a, b)
+    self[a], self[b] = self[b], self[a]
+    self
+  end
+end

data/lib/delaunator/version.rb

@@ -0,0 +1,3 @@
+module Delaunator
+  VERSION = "0.1.0"
+end

metadata

@@ -0,0 +1,114 @@
+--- !ruby/object:Gem::Specification
+name: delaunator
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Wolfgang Wohanka
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2019-12-26 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.12.2
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.12.2
+description: Delaunay triangulation of 2D points
+email:
+- wolfgang.wohanka@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- delaunator.gemspec
+- fixtures/ukraine.yml
+- lib/delaunator.rb
+- lib/delaunator/triangulator.rb
+- lib/delaunator/version.rb
+homepage: https://github.com/hendrixfan/delaunator-ruby
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/hendrixfan/delaunator-ruby
+  source_code_uri: https://github.com/hendrixfan/delaunator-ruby
+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.0.6
+signing_key: 
+specification_version: 4
+summary: Delaunay triangulation of 2D points
+test_files: []