2000 character limit reached
Dynamic Connectivity in Disk Graphs
Published 28 Jun 2021 in cs.CG and cs.DS | (2106.14935v2)
Abstract: Let $S$ be a set of $n$ sites in the plane, so that every site $s \in S$ has an associated radius $r_s > 0$. Let $\mathcal{D}(S)$ be the disk intersection graph defined by $S$, i.e., the graph with vertex set $S$ and an edge between two distinct sites $s, t \in S$ if and only if the disks with centers $s$, $t$ and radii $r_s$, $r_t$ intersect.Our goal is to design data structures that maintain the connectivity structure of $\mathcal{D}(S)$ as sites are inserted and/or deleted in $S$.
- Maintaining the union of unit discs under insertions with near-optimal overhead. In Proc. 35th Annu. Sympos. Comput. Geom. (SoCG), pages 26:1–26:15, 2019. doi:10.4230/LIPIcs.SoCG.2019.26.
- Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom., 6(3):407–422, 1991. doi:10.1007/BF02574698.
- On range searching with semialgebraic sets. Discrete Comput. Geom., 11(4):393–418, 1994. doi:10.1007/BF02574015.
- Biased search trees. SIAM J. Comput., 14:545–568, 1985.
- Decomposable searching problems I: Static-to-dynamic transformation. J. Algorithms, 1(4):58, 1980.
- Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008. doi:10.1007/978-3-540-77974-2.
- Dynamic planar convex hull. In Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pages 617–626, 2002. doi:10.1109/SFCS.2002.1181985.
- Preprocessing imprecise points for Delaunay triangulation: Simplified and extended. Algorithmica, 61(3):674–693, 2011. doi:10.1007/s00453-010-9430-0.
- Shortest paths in intersection graphs of unit disks. Comput. Geom. Theory Appl., 48(4):360–367, 2015. doi:10.1016/j.comgeo.2014.12.003.
- Planar hop spanners for unit disk graphs. In Algorithms for Sensor Systems, Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 2010. doi:10.1007/978-3-642-16988-5_2.
- Timothy M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48(1):1–12, 2001. doi:10.1145/363647.363652.
- Timothy M. Chan. A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM, 57(3):16:1–16:15, 2010. doi:10.1145/1706591.1706596.
- Timothy M. Chan. Dynamic geometric data structures via shallow cuttings. Discrete Comput. Geom., 64(4):1235–1252, 2020. doi:10.1007/s00454-020-00229-5.
- Dynamic connectivity: Connecting to networks and geometry. SIAM J. Comput., 40(2):333–349, 2011. doi:10.1137/090751670.
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. Discrete Comput. Geom., 56(4):866–881, 2016. doi:10.1007/s00454-016-9784-4.
- Introduction to Algorithms. MIT Press, 3rd edition, 2009.
- Optimal point location in a monotone subdivision. SIAM J. Comput., 15(2):317–340, 1986. doi:10.1137/0215023.
- David Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom., 13(1):111–122, 1995. doi:10.1007/BF02574030.
- Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13(1):33–54, 1992. doi:10.1016/0196-6774(92)90004-V.
- Steven Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153, 1987. doi:10.1007/BF01840357.
- Sariel Har-Peled. Geometric Approximation Algorithms, volume 173. American Mathematical Society, 2011. doi:10.1090/surv/173.
- Christian Hofer. Fast Dynamic Planar Convex Set Maintenance Using Finger Trees. Bachelor thesis, Freie Universität Berlin, 2017.
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723–760, 2001. doi:10.1145/502090.502095.
- Fully dynamic connectivity in O(logn(loglogn)2)𝑂𝑛superscript𝑛2O(\log n(\log\log n)^{2})italic_O ( roman_log italic_n ( roman_log roman_log italic_n ) start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT ) amortized expected time. In Proc. 28th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 510–520. 2017. doi:10.1137/1.9781611974782.32.
- Triangles and girth in disk graphs and transmission graphs. In 27th Annual European Symposium on Algorithms, ESA 2019, pages 64:1–64:14, 2019. doi:10.4230/LIPIcs.ESA.2019.64.
- Spanners for directed transmission graphs. SIAM J. Comput., 47(4):1585–1609, 2018. doi:10.1137/16M1059692.
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. Discrete Comput. Geom., 64(3):838–904, 2020. doi:10.1007/s00454-020-00243-7.
- Faster kinetic heaps and their use in broadcast scheduling. In Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 836–844, 2001.
- Dynamic graph connectivity in polylogarithmic worst case time. In Proc. 24th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), SODA ’13, pages 1131–1142, 2013. doi:10.1137/1.9781611973105.81.
- Katharina Klost. An algorithmic framework for the single source shortest path problem with applications to disk graphs. Comput. Geom. Theory Appl., 111:101979, 2023. doi:10.1016/j.comgeo.2022.101979.
- Chih-Hung Liu. Nearly optimal planar k𝑘kitalic_k nearest neighbors queries under general distance functions. SIAM J. Comput., 51(3):723–765, 2022. doi:10.1137/20m1388371.
- Triangulating the square and squaring the triangle: Quadtrees and Delaunay triangulations are equivalent. SIAM J. Comput., 41(4):941–974, 2012. doi:10.1137/110825698.
- Dynamic planar point location with sub-logarithmic local updates. In Frank Dehne, Roberto Solis-Oba, and Jörg-Rüdiger Sack, editors, Algorithms and Data Structures, pages 499–511, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
- Proximity algorithms. In Jacob E. Goodman, Joseph O’Rourke, and Csaba D. Tóth, editors, Handbook of Discrete and Computational Geometry, chapter 32, pages 849–874. Third edition, 2017.
- Mark H. Overmars and Jan van Leeuwen. Maintenance of configurations in the plane. J. Comput. System Sci., 23(2):166–204, 1981. doi:10.1016/0022-0000(81)90012-X.
- Computational Geometry - An Introduction. Springer, 1985. doi:10.1007/978-1-4612-1098-6.
- John H. Reif. A topological approach to dynamic graph connectivity. Information Processing Letters, 25(1):65–70, 1987. doi:10.1016/0020-0190(87)90095-0.
- Micha Sharir. Intersection and closest-pair problems for a set of planar discs. SIAM J. Comput., 14(2):448–468, 1985. doi:10.1137/0214034.
- A data structure for dynamic trees. J. Comput. System Sci., 26(3):362–391, 1983. doi:10.1016/0022-0000(83)90006-5.
- Mikkel Thorup. Near-optimal fully-dynamic graph connectivity. In Proc. 32nd Annu. ACM Sympos. Theory Comput. (STOC), pages 343–350, 2000.
- Christian Wulff-Nilsen. Faster deterministic fully-dynamic graph connectivity. In Proc. 24th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 1757–1769, 2013. doi:10.1137/1.9781611973105.126.
- A general approach to D-dimensional geometric queries. In Proc. 17th Annu. ACM Sympos. Theory Comput. (STOC), pages 163–168, 1985. doi:10.1145/22145.22163.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.