Algorithm: Check point inclusion in polygon

最新推荐文章于 2024-07-15 22:10:26 发布

蜜汁小强

最新推荐文章于 2024-07-15 22:10:26 发布

阅读量242

点赞数

分类专栏： node.js 文章标签：算法

本文链接：https://blog.csdn.net/wxqee/article/details/122428751

版权

node.js 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Story

Background is, I just finished an interview with examiner overseas. He gave me an algorithm question, that let me check a point if it’s included in a polygon.

At first, I lose my direction, not sure how to check. In the past 15 years, I’ve never met this kind of issue in projects. After some guiding from him, I find the way to check minutes later. We can draw a line to the diagram, and see how may crosses. Odd for inclusion, otherwise exclusion.

After the interview, I tried the code part, and done some research to compare the thought. There is one I want to share out:

Solution

Codes

try the following codes on JSBin or locally http server.

<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <meta name="viewport" content="width=device-width">
  <title>JS Bin</title>
</head>
<link href="https://code.jquery.com/qunit/qunit-git.css" rel="stylesheet" type="text/css" />
<script src="https://code.jquery.com/qunit/qunit-git.js"></script>
<body>

  <div id="qunit"></div>
  <div id="qunit-fixture"></div>
  
</body>
</html>

class Solution {
  constructor(points, target) {
    this.points = points
    this.target = target
  }
  solve() {
    const n = this.points.length
    const [testX, testY] = this.target
    let c = false
    for (let i = 0, j = n - 1; i < n; j = i++) {
      const [iX, iY] = this.points[i]
      const [jX, jY] = this.points[j]
      if (
        (iY > testY) !== (jY > testY) &&
        (testX < (jX - iX) * (testY - iY) / (jY - iY) + iX)
      ) {
        c = !c
      }
    }
    return c
  }
}


QUnit.module('pology', function() {
  QUnit.test('triangle', function(assert) {
    const points = [[5,5],[1,1],[6,1]]
    assert.ok(new Solution(points, [5,4]).solve());
    assert.ok(new Solution(points, [5,2]).solve());
    assert.ok(new Solution(points, [3,3]).solve());
    assert.notOk(new Solution(points, [5,5]).solve());
//     assert.notOk(new Solution(points, [1,1]).solve()); // Special
    assert.notOk(new Solution(points, [6,1]).solve());
  });
  QUnit.test('square', function(assert) {
    const points = [[1,1],[1,2],[2,2],[2,1]]
    assert.ok(new Solution(points, [1.1,1.1]).solve());
    assert.notOk(new Solution(points, [0.9,0.9]).solve());
    assert.ok(new Solution(points, [1, 1.1]).solve());
    assert.ok(new Solution(points, [1.5, 1.5]).solve());
    assert.notOk(new Solution(points, [0,0]).solve());
  });
});