Research Article
Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees
Algorithm 3
Pseudocode for the raise and lower propagation.
| ProcessRaise ((; , )) | | 50. for all (; , )Adj8() | | 51. ← .QueryANode() | | 52. ← .QueryANode() | | 53. if ≠ and | | 54. if has been removed | | 55. ClearCell() | | 56. Raise.UpdateANode(, true) | | 57. Open.push(, ) | | 58. Raise.UpdateANode(,false) | | End | | ProcessLower ((; ,)) | | 59. for all (; , )Adj8() | | 60. ← .QueryANode() | | 61. ← .QueryANode() | | 62. if = false | | 63. ← + dist | | 64. if | | 65. Obst.UpdateANode(,) | | 66. Open.push(, ) | | 67. else CheckVoro (,) | | End | | CheckVoro((; , ), (; , )) | | 68. ← .QueryANode() | | 69. ← .QueryANode() | | 70. ← | | 71. ← | | 72. if ( | | 73. if ≤ | | 74. Voro.UpdateANode(, true) | | 75. if ≤ | | 76. Voro.UpdateANode(, true) | | End |
|
