Author:
Anderson R.,Beanie P.,Brisson E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. K. Yap. Parallel computational geometry.Algorithmica, 3:293–326, 1988.
2. A. Aggarwal and J. Wein. Computational geometry: lecture notes for 18.409, spring 1988. Technical Report MIT/LCS/RSS 3, MIT Laboratory for Computer Science, 1988.
3. R. J. Anderson, P. Beame, and E. Brisson. Parallel algorithms for arrangements.Proceedings of the Second Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 298–306.
4. D. Arnon, G. Collins, and S. McCallum. Cylindrical algebraic decomposition,I andII. SIAM Journal on Computing, 13(4):865–889, 1984.
5. M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: a technique for designing parallel algorithms.SIAM Journal on Computing, 18:499–532, 1989.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stripped halfedge data structure for parallel computation of arrangements of segments;The Visual Computer;2021-06-16
2. Algorithms for hotspot computation on trajectory data;Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2013-11-05