Efficient Processing of Moving<i> k</i>-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

<div>Partitioning of a segment <svg height="15.4241pt" id="M515" style="vertical-align:-3.2911pt" version="1.1" viewbox="-0.0498162 -12.133 22.963 15.4241" width="22.963pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,-5.911)"><path d="M885 230V280H158L260 427L238 442C164 361 93 290 53 255C93 220 164 149 238 68L260 83L158 230H885Z" id="g117-147"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="954" vert-adv-y="954"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,6.614,-5.911)"><path d="M567 230V280H69V230H567Z" id="g117-149"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="636" vert-adv-y="636"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,12.007,-5.911)"><path d="M567 230V280H69V230H567Z" id="g117-149"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="636" vert-adv-y="636"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,14.518,-5.911)"><path d="M567 230V280H69V230H567Z" id="g117-149"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="636" vert-adv-y="636"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M495 86L479 114C446 82 419 66 409 66C401 66 401 72 406 97C420 166 436 231 453 297C489 435 454 448 428 448C406 448 384 439 354 422C305 394 222 327 161 247H159L183 345C200 415 194 448 173 448C143 448 82 410 23 351L38 325C64 349 95 371 105 371C111 371 116 365 109 336L25 -4L31 -12C50 -4 77 3 107 9C119 69 132 122 145 168C197 254 321 381 370 381C387 381 393 374 378 305L329 95C309 17 320 -12 345 -12C372 -12 430 19 495 86Z" id="g113-111"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="502" vert-adv-y="502"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,6.461,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,11.407,0)"><path d="M495 86L479 114C446 82 419 66 409 66C401 66 401 72 406 97C420 166 436 231 453 297C489 435 454 448 428 448C406 448 384 439 354 422C305 394 222 327 161 247H159L183 345C200 415 194 448 173 448C143 448 82 410 23 351L38 325C64 349 95 371 105 371C111 371 116 365 109 336L25 -4L31 -12C50 -4 77 3 107 9C119 69 132 122 145 168C197 254 321 381 370 381C387 381 393 374 378 305L329 95C309 17 320 -12 345 -12C372 -12 430 19 495 86Z" id="g113-111"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="502" vert-adv-y="502"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,17.868,3.132)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z" id="g50-52"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg> into three safe segments.</div>

Mobile Information Systems

fig11

Figure 11

Figure 11: Efficient Processing of Moving<i> k</i>-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks 

Mobile Information Systems

Efficient Processing of Moving k-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

Figure 11