Parallel processing for efficient subdivision search
作者： N. Dadoun , D. G. Kirkpatrick
DOI: 10.1145/41958.41980
关键词:
摘要:
acm.org
sci-hub.se 参考文章(15)
Leonidas J. Guibas, Colm Ó'Dúnlaing, Bernard Chazelle, Alok Aggarwal, Chee-Keng Yap, Parallel Computational Geometry (Extended Abstract) foundations of computer science. pp. 468- 477 ,(1985)
David P. Dobkin, David G. Kirkpatrick, Fast Detection of Polyhedral Intersections international colloquium on automata, languages and programming. pp. 154- 165 ,(1982) , 10.1007/BFB0012765
David P. Dobkin, David G. Kirkpatrick, Fast detection of polyhedral intersection Theoretical Computer Science. ,vol. 27, pp. 241- 253 ,(1983) , 10.1016/0304-3975(82)90120-7
David P Dobkin, David G Kirkpatrick, A Linear Algorithm for Determining the Separation of Convex Polyhedra Journal of Algorithms. ,vol. 6, pp. 381- 392 ,(1983) , 10.1016/0196-6774(85)90007-0
Michael Ian Shamos, Dan Hoey, Closest-point problems foundations of computer science. pp. 151- 162 ,(1975) , 10.1109/SFCS.1975.8
Gary L. Miller, John H. Reif, Parallel tree contraction and its application 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). pp. 478- 489 ,(1985) , 10.1109/SFCS.1985.43
R Cole, U Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms symposium on the theory of computing. pp. 206- 219 ,(1986) , 10.1145/12130.12151
F. P. Preparata, S. J. Hong, Convex hulls of finite sets of points in two and three dimensions Communications of the ACM. ,vol. 20, pp. 87- 93 ,(1977) , 10.1145/359423.359430
A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, C. Yap, Parallel computational geometry Algorithmica. ,vol. 3, pp. 293- 327 ,(1988) , 10.1007/BF01762120
M J Atallah, M T Goodrich, Efficient plane sweeping in parallel Proceedings of the second annual symposium on Computational geometry - SCG '86. pp. 216- 225 ,(1986) , 10.1145/10515.10539