point-in-big-polygon

WebJar for point-in-big-polygon

Лицензия

Лицензия

MIT
Группа

Группа

org.webjars.npm
Идентификатор

Идентификатор

point-in-big-polygon
Последняя версия

Последняя версия

2.0.0
Дата

Дата

Тип

Тип

jar
Описание

Описание

point-in-big-polygon
WebJar for point-in-big-polygon
Ссылка на сайт

Ссылка на сайт

http://webjars.org
Система контроля версий

Система контроля версий

https://github.com/mikolalysenko/point-in-big-polygon

Скачать point-in-big-polygon

Как подключить последнюю версию

<!-- https://jarcasting.com/artifacts/org.webjars.npm/point-in-big-polygon/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>point-in-big-polygon</artifactId>
    <version>2.0.0</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/point-in-big-polygon/
implementation 'org.webjars.npm:point-in-big-polygon:2.0.0'
// https://jarcasting.com/artifacts/org.webjars.npm/point-in-big-polygon/
implementation ("org.webjars.npm:point-in-big-polygon:2.0.0")
'org.webjars.npm:point-in-big-polygon:jar:2.0.0'
<dependency org="org.webjars.npm" name="point-in-big-polygon" rev="2.0.0">
  <artifact name="point-in-big-polygon" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='point-in-big-polygon', version='2.0.0')
)
libraryDependencies += "org.webjars.npm" % "point-in-big-polygon" % "2.0.0"
[org.webjars.npm/point-in-big-polygon "2.0.0"]

Зависимости

compile (4)

Идентификатор библиотеки Тип Версия
org.webjars.npm : binary-search-bounds jar [1.0.0,2)
org.webjars.npm : interval-tree-1d jar [1.0.1,2)
org.webjars.npm : robust-orientation jar [1.1.3,2)
org.webjars.npm : slab-decomposition jar [1.0.1,2)

Модули Проекта

Данный проект не имеет модулей.

point-in-big-polygon

Industrial scale point-in-polygon test. Given a polygon, this module preprocesses it in O(n log(n)) time such that any point can be classified against the polygon in O(log(n)) operations. All computations are performed in exact arithmetic.

If you want to use multiple polygons/regions, you should use point-in-region instead.

Example

var preprocessPolygon = require('point-in-big-polygon')

//Define the polygon loops
var loops = [
  [ [-10, -10], [-10, 10], [10, 10], [10, -10] ],
  [ [-1, -1], [1, -1], [1, 1], [-1, 1] ]
]

//Preprocess it
var classifyPoint = preprocessPolygon(loops)

//Render polygon test in ASCII to console
var img = []
for(var y=-12; y<=12; y+=1) {
  var row = []
  for(var x=-12; x<=12; x+=0.5) {
    var v = classifyPoint([x, y])
    if(v < 0) {
      row.push('-')
    } else if(v === 0) {
      row.push('o')
    } else {
      row.push('+')
    }
  }
  img.push(row.join(''))
}
console.log(img.join('\n'))

Example output:

+++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++++++++++++++++++++++++++++++++
++++ooooooooooooooooooooooooooooooooooooooooo++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o-----------------ooooo-----------------o++++
++++o-----------------o+++o-----------------o++++
++++o-----------------ooooo-----------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++o---------------------------------------o++++
++++ooooooooooooooooooooooooooooooooooooooooo++++
+++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++++++++++++++++++++++++++++++++

Install

This module works in any reasonable CommonJS environment including browserify, iojs and node.js.

npm install point-in-big-polygon

API

Constructor

var classifyPoint = require("point-in-big-polygon")(loops)

Preprocess a polygon given by a collection of clockwise oriented loops to handle point membership queries.

  • loops are a collection of oriented loops representing the boundary of the polygon. These loops must be manifold (ie no self intersections or dangling edges).

Returns A point membership function that can be used to classify points relative to the function

Method

classifyPoint(p)

This function is the result of running the preprocessing operation on a polygon. It takes a single point as input and tests it against the boundary.

  • p is a point encoded as a length 2 array

Returns A number which classifies p relative to the boundary

  • -1 means that p is inside
  • 0 means that p is on the boundary
  • +1 means that p is outside

Credits

(c) 2014 Mikola Lysenko. MIT License

Версии библиотеки

Версия
2.0.0