IncrementalDelaunayTriangulator.js 1.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  1. import QuadEdge from './quadedge/QuadEdge'
  2. export default class IncrementalDelaunayTriangulator {
  3. constructor() {
  4. IncrementalDelaunayTriangulator.constructor_.apply(this, arguments)
  5. }
  6. static constructor_() {
  7. this._subdiv = null
  8. this._isUsingTolerance = false
  9. const subdiv = arguments[0]
  10. this._subdiv = subdiv
  11. this._isUsingTolerance = subdiv.getTolerance() > 0.0
  12. }
  13. insertSite(v) {
  14. let e = this._subdiv.locate(v)
  15. if (this._subdiv.isVertexOfEdge(e, v)) {
  16. return e
  17. } else if (this._subdiv.isOnEdge(e, v.getCoordinate())) {
  18. e = e.oPrev()
  19. this._subdiv.delete(e.oNext())
  20. }
  21. let base = this._subdiv.makeEdge(e.orig(), v)
  22. QuadEdge.splice(base, e)
  23. const startEdge = base
  24. do {
  25. base = this._subdiv.connect(e, base.sym())
  26. e = base.oPrev()
  27. } while (e.lNext() !== startEdge)
  28. do {
  29. const t = e.oPrev()
  30. if (t.dest().rightOf(e) && v.isInCircle(e.orig(), t.dest(), e.dest())) {
  31. QuadEdge.swap(e)
  32. e = e.oPrev()
  33. } else if (e.oNext() === startEdge) {
  34. return base
  35. } else {
  36. e = e.oNext().lPrev()
  37. }
  38. } while (true)
  39. }
  40. insertSites(vertices) {
  41. for (let i = vertices.iterator(); i.hasNext(); ) {
  42. const v = i.next()
  43. this.insertSite(v)
  44. }
  45. }
  46. }