Seminar • Algorithms and Complexity — Dynamic Planar Point Location in External MemoryExport this event to calendar

Thursday, November 7, 2019 1:30 PM EST

Yakov Nekrich, Department of Computer Science
Michigan Technological University

We describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in O(logBn(loglogBn)3)) I/Os and updates in O(logBn(loglogBn)2)) amortized I/Os, where n is the number of segments in the subdivision and B is the block size. This is the first dynamic data structure with almost-optimal query cost. For comparison all previously known results for this problem require O(log2Bn) I/Os to answer queries. Our result almost matches the best known upper bound in the internal-memory model. 

Joint work with Ian Munro.

Location 
DC - William G. Davis Computer Research Centre
1304
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
  1. 2024 (97)
    1. April (20)
    2. March (27)
    3. February (25)
    4. January (25)
  2. 2023 (296)
    1. December (20)
    2. November (28)
    3. October (15)
    4. September (25)
    5. August (30)
    6. July (30)
    7. June (22)
    8. May (23)
    9. April (32)
    10. March (31)
    11. February (18)
    12. January (22)
  3. 2022 (245)
  4. 2021 (210)
  5. 2020 (217)
  6. 2019 (255)
  7. 2018 (217)
  8. 2017 (36)
  9. 2016 (21)
  10. 2015 (36)
  11. 2014 (33)
  12. 2013 (23)
  13. 2012 (4)
  14. 2011 (1)
  15. 2010 (1)
  16. 2009 (1)
  17. 2008 (1)