Resolving SINR Queries in a Dynamic Setting
暂无分享,去创建一个
[1] Mark H. Overmars,et al. The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.
[2] Boris Aronov,et al. Batched Point Location in SINR Diagrams via Algebraic Tools , 2015, ICALP.
[3] David Peleg,et al. Nonuniform SINR+Voroni Diagrams Are Effectively Uniform , 2015, DISC.
[4] Sariel Har-Peled,et al. Approximating Minimization Diagrams and Generalized Proximity Search , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[5] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[6] David Peleg,et al. SINR diagram with interference cancellation , 2017, Ad Hoc Networks.
[7] Timothy M. Chan,et al. On Approximate Range Counting and Depth , 2007, SCG '07.
[8] George S. Lueker,et al. Adding range restriction capability to dynamic data structures , 1985, JACM.
[9] Timothy M. Chan. Dynamic Geometric Data Structures via Shallow Cuttings , 2019, Discrete & Computational Geometry.
[10] J. Ian Munro,et al. Space efficient data structures for dynamic orthogonal range counting , 2014, Comput. Geom..
[11] David Peleg,et al. SINR Diagrams: Convexity and Its Applications in Wireless Networks , 2012, JACM.
[12] Jirí Matousek,et al. Efficient partition trees , 1992, Discret. Comput. Geom..
[13] David Peleg,et al. The Topology of Wireless Communication , 2011, J. ACM.
[14] Pankaj K. Agarwal. Range Searching , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[15] Bernard Chazelle,et al. A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..
[16] Timothy M. Chan. A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries , 2010, J. ACM.
[17] Boris Aronov,et al. Resolving SINR Queries in a Dynamic Setting , 2020, SIAM J. Comput..
[18] Haim Kaplan,et al. Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications , 2016, Discrete & Computational Geometry.