Some dynamic computational geometry problems-Reference-Cited by-同舟云学术

Some dynamic computational geometry problems

Author:

Atallah Mikhail J.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation

Reference15 articles.

1. M.J. Atallah, Dynamic computational geometry. TR-450, Computer Science Dept., Purdue University, West-Lafayette, IN.

2. Lower bounds for algebraic computation trees;Ben-Or,1983

3. Divide-and-conquer in multidimensional space;Bentley,1976-1976

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

1. The Minimum Moving Spanning Tree Problem;Lecture Notes in Computer Science;2021

3. A Study on the Spatiotemporal Distribution of POI Tourists;Proceedings of the 2020 2nd International Conference on Big Data and Artificial Intelligence;2020-04-28

4. A Study on Spatial Layout of Tourist Attractions Based on POI;Proceedings of the 2020 2nd International Conference on Big Data and Artificial Intelligence;2020-04-28

5. A Space-time Analysis of Tourism Information Flow Based on SNA Information;Proceedings of the 2020 2nd International Conference on Big Data and Artificial Intelligence;2020-04-28