jsts
Version:
A JavaScript library of spatial predicates and functions for processing geometry
57 lines (56 loc) • 1.91 kB
JavaScript
import STRtree from '../../index/strtree/STRtree.js'
import IsValidOp from './IsValidOp.js'
import PointLocation from '../../algorithm/PointLocation.js'
import ArrayList from '../../../../../java/util/ArrayList.js'
import Envelope from '../../geom/Envelope.js'
export default class IndexedNestedRingTester {
constructor() {
IndexedNestedRingTester.constructor_.apply(this, arguments)
}
static constructor_() {
this._graph = null
this._rings = new ArrayList()
this._totalEnv = new Envelope()
this._index = null
this._nestedPt = null
const graph = arguments[0]
this._graph = graph
}
add(ring) {
this._rings.add(ring)
this._totalEnv.expandToInclude(ring.getEnvelopeInternal())
}
getNestedPoint() {
return this._nestedPt
}
buildIndex() {
this._index = new STRtree()
for (let i = 0; i < this._rings.size(); i++) {
const ring = this._rings.get(i)
const env = ring.getEnvelopeInternal()
this._index.insert(env, ring)
}
}
isNonNested() {
this.buildIndex()
for (let i = 0; i < this._rings.size(); i++) {
const innerRing = this._rings.get(i)
const innerRingPts = innerRing.getCoordinates()
const results = this._index.query(innerRing.getEnvelopeInternal())
for (let j = 0; j < results.size(); j++) {
const searchRing = results.get(j)
const searchRingPts = searchRing.getCoordinates()
if (innerRing === searchRing) continue
if (!innerRing.getEnvelopeInternal().intersects(searchRing.getEnvelopeInternal())) continue
const innerRingPt = IsValidOp.findPtNotNode(innerRingPts, searchRing, this._graph)
if (innerRingPt === null) continue
const isInside = PointLocation.isInRing(innerRingPt, searchRingPts)
if (isInside) {
this._nestedPt = innerRingPt
return false
}
}
}
return true
}
}