node-red-contrib-tak-registration
Version:
A Node-RED node to register to TAK and to help wrap files as datapackages to send to TAK
110 lines (106 loc) • 3.52 kB
JavaScript
export default class SegmentIntersector {
constructor() {
SegmentIntersector.constructor_.apply(this, arguments)
}
static constructor_() {
this._hasIntersection = false
this._hasProper = false
this._hasProperInterior = false
this._properIntersectionPoint = null
this._li = null
this._includeProper = null
this._recordIsolated = null
this._isSelfIntersection = null
this._numIntersections = 0
this.numTests = 0
this._bdyNodes = null
this._isDone = false
this._isDoneWhenProperInt = false
const li = arguments[0], includeProper = arguments[1], recordIsolated = arguments[2]
this._li = li
this._includeProper = includeProper
this._recordIsolated = recordIsolated
}
static isAdjacentSegments(i1, i2) {
return Math.abs(i1 - i2) === 1
}
isTrivialIntersection(e0, segIndex0, e1, segIndex1) {
if (e0 === e1)
if (this._li.getIntersectionNum() === 1) {
if (SegmentIntersector.isAdjacentSegments(segIndex0, segIndex1)) return true
if (e0.isClosed()) {
const maxSegIndex = e0.getNumPoints() - 1
if (segIndex0 === 0 && segIndex1 === maxSegIndex || segIndex1 === 0 && segIndex0 === maxSegIndex)
return true
}
}
return false
}
getProperIntersectionPoint() {
return this._properIntersectionPoint
}
setIsDoneIfProperInt(isDoneWhenProperInt) {
this._isDoneWhenProperInt = isDoneWhenProperInt
}
hasProperInteriorIntersection() {
return this._hasProperInterior
}
isBoundaryPointInternal(li, bdyNodes) {
for (let i = bdyNodes.iterator(); i.hasNext(); ) {
const node = i.next()
const pt = node.getCoordinate()
if (li.isIntersection(pt)) return true
}
return false
}
hasProperIntersection() {
return this._hasProper
}
hasIntersection() {
return this._hasIntersection
}
isDone() {
return this._isDone
}
isBoundaryPoint(li, bdyNodes) {
if (bdyNodes === null) return false
if (this.isBoundaryPointInternal(li, bdyNodes[0])) return true
if (this.isBoundaryPointInternal(li, bdyNodes[1])) return true
return false
}
setBoundaryNodes(bdyNodes0, bdyNodes1) {
this._bdyNodes = new Array(2).fill(null)
this._bdyNodes[0] = bdyNodes0
this._bdyNodes[1] = bdyNodes1
}
addIntersections(e0, segIndex0, e1, segIndex1) {
if (e0 === e1 && segIndex0 === segIndex1) return null
this.numTests++
const p00 = e0.getCoordinates()[segIndex0]
const p01 = e0.getCoordinates()[segIndex0 + 1]
const p10 = e1.getCoordinates()[segIndex1]
const p11 = e1.getCoordinates()[segIndex1 + 1]
this._li.computeIntersection(p00, p01, p10, p11)
if (this._li.hasIntersection()) {
if (this._recordIsolated) {
e0.setIsolated(false)
e1.setIsolated(false)
}
this._numIntersections++
if (!this.isTrivialIntersection(e0, segIndex0, e1, segIndex1)) {
this._hasIntersection = true
if (this._includeProper || !this._li.isProper()) {
e0.addIntersections(this._li, segIndex0, 0)
e1.addIntersections(this._li, segIndex1, 1)
}
if (this._li.isProper()) {
this._properIntersectionPoint = this._li.getIntersection(0).copy()
this._hasProper = true
if (this._isDoneWhenProperInt)
this._isDone = true
if (!this.isBoundaryPoint(this._li, this._bdyNodes)) this._hasProperInterior = true
}
}
}
}
}