1. Robust and efficient polygon overlay on parallel stream processors
2. Dealing with degeneracy in triangulation
3. H. Carr, J. Snoeyink, and U. Axen. 2000. Computing contour trees in all dimensions. In Proceedings of the Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms (SODA ’00). SIAM, Philadelphia, PA, 918–926.
4. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink. 1991. Computing a face in an arrangement of line segments. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’91). SIAM, Philadelphia, PA, 441–448.
5. PinMesh—Fast and exact 3D point location queries using a uniform grid