Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries. © 1988 Springer-Verlag New York Inc.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics