第 1 到 7 筆結果,共 7 筆。
公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 1989 | Parallel Batched Planar Point Location on the CCC | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 33, 175-179 | |||
2 | 1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | |||
3 | 1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | |||
4 | 1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | |||
5 | 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | |||
6 | 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | |||
7 | 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 |