Kinetic Spanners in ℝd-Reference-Cited by-同舟云学术

Kinetic Spanners in ℝd

Published:2011-04-05 Issue:4 Volume:45 Page:723-736
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Abam Mohammad Ali,de Berg Mark

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-011-9343-y

Reference23 articles.

1. Abam, M.A., de Berg, M., Speckmann, B.: Kinetic kd-trees and longest-side kd-trees. In: Proc. ACM Symposium on Computational Geometry, pp. 364–372 (2007)

2. Abam, M.A., de Berg, M., Gudmundsson, J.: A simple and efficient kinetic spanner. In: Proc. ACM Symposium on Computational Geometry, pp. 306–310 (2008)

3. Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proc. ACM Symposium on Computational Geometry, pp. 344–351 (1997)

4. Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–28 (1999)

5. Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Comput. Geom. 28, 11–18 (2004)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. APPROXIMATE k-NEAREST NEIGHBOR GRAPH ON MOVING POINTS;TRANS COMB;2023

2. Vertex Fault-Tolerant Geometric Spanners for Weighted Points;International Journal of Computational Geometry & Applications;2022-09

3. Vertex fault-tolerant spanners for weighted points in polygonal domains;Discrete Mathematics, Algorithms and Applications;2022-04-11

4. Geodesic spanners for points in R3 amid axis-parallel boxes;Information Processing Letters;2021-02

5. Geometric spanner games;Theoretical Computer Science;2019-11