par Iacono, John 
;Karsin, Benjamin ;Koumoutsos, Grigorios
Référence Leibniz international proceedings in informatics, 149, 58
Publication Publié, 2019-12-01
;Karsin, Benjamin ;Koumoutsos, Grigorios Référence Leibniz international proceedings in informatics, 149, 58
Publication Publié, 2019-12-01
Article révisé par les pairs
| Résumé : | We study dynamic planar point location in the External Memory Model or Disk Access Model (DAM). Previous work in this model achieves polylog query and polylog amortized update time. We present a data structure with O(log2B N) query time and O(B11−ε logB N) amortized update time, where N is the number of segments, B the block size and ε is a small positive constant, under the assumption that all faces have constant size. This is a B1−ε factor faster for updates than the fastest previous structure, and brings the cost of insertion and deletion down to subconstant amortized time for reasonable choices of N and B. Our structure solves the problem of vertical ray-shooting queries among a dynamic set of interior-disjoint line segments; this is well-known to solve dynamic planar point location for a connected subdivision of the plane with faces of constant size. |
