Funder
Division of Computing and Communication Foundations
Office of International Science and Engineering
National Science Foundation
United States - Israel Binational Science Foundation
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Allen, S., Barba, L., Iacono, J., Langerman, S.: Incremental Voronoi diagrams. Discrete Comput. Geom. (to appear). Special issue of selected papers from the 2016 Symposium on Computational Geometry (SoCG’16).
http://arxiv.org/abs/1603.08485
2. Aggarwal, A., Guibas, L.J., Saxe, J.B., Shor, P.W.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. 4(6), 591–604 (1989)
3. Chan, T.M.: A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM 57(3), Article No. 16 (2010).
https://doi.org/10.1145/1706591.1706596
4. Cromley, R.G.: Digital Cartography. Prentice Hall, Upper Saddle River (1991)
5. Chiang, Y.-J., Tamassia, R.: Dynamic algorithms in computational geometry. Proc. IEEE 80(9), 1412–1434 (1992)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximating the Discrete Center Line Segment in Linear Time;Lecture Notes in Computer Science;2023
2. Efficient k-Center Algorithms for Planar Points in Convex Position;Lecture Notes in Computer Science;2023
3. Concurrent Link-Cut Trees;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
4. Approximate curve-restricted simplification of polygonal curves;International Journal of Computer Mathematics: Computer Systems Theory;2021-04-01
5. Sublinear Explicit Incremental Planar Voronoi Diagrams;Journal of Information Processing;2020