| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | | | |
| 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | | | |
| 1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | | | |
| 1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | | | |
| 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 | | | |
| 1989 | Parallel Batched Planar Point Location on the CCC | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 33, 175-179 | | | |
| 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | | | |
