公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 |
2004 | The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry and Applications 14, 421-452 | | | |
2015 | The k-Nearest-Neighbor Voronoi Diagram Revisited | Chih-Hung Liu; Evanthia Papadopoulou; D. T. Lee | Algorithmica 71(2), 429-449 | | | |
2001 | The L∞ Voronoi Diagram of Segments and VLSI Applications | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry & Applications 11(5), 503-528 | | | |
2002 | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing | Papadopoulou, E.; Lee, D. T. | | | | |
2018 | The multi-service center problem | Hung-I Yu; Cheng-Chung Li; D.T. Lee | Theoretical Computer Science 705, 58-74 | | | |
1985 | The Power of Geometric Duality | Chazelle, B.; Guibas, L. J.; Lee, D. T. | BIT 25, 76-90 | | | |
1985 | The Power of Geometric Duality Revisited | Lee, D. T. ; Ching, Y. T. | Info. Processing Letters 21, 117-122 | | | |
1997 | The Smallest Pair of Non-crossing Paths in a Rectilinear Polygon | Yang, C. D.; Lee, D. T. ; Wong, C. K. | IEEE Trans. Comput. 46, 930-941 | | | |
1996 | The Steiner Minimal Tree Problem in the λ-geometry Plane | Lee, D. T. ; Shen, C. F. | | | | |
2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities | Jia-Yau Shiao; Mong-Jen Kao; Ching-Chi Lin; D. T. Lee | | | | |
2007 | Time Convex Hull with a Highway | Yu, T. K.; Lee, D. T. | | | | |
2004 | Time-based Voronoi Diagrams | Lee, D. T. ; Liao, C. S.; Wang, W. B. | | | | |
1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | | | |
2001 | Towards Web-Based Computing | Aoki, K.; Lee, D. T. | International Journal of Computational Geometry and Applications 11, 71-104 | | | |
2004 | Travel Time Prediction with Support Vector Regression | Wu, C. H.; Ho, Jan-Ming ; Lee, D. T. | IEEE Transactions on Intelligent Transportation Systems 5(4), 276-281 | | | |
1980 | Two Algorithms for Constructing Delaunay Triangulations | Lee, D. T. ; Schacter, B. J. | International Journal of Computer & Information Sciences 9, 219-242 | | | |
1980 | Two Dimensional Voronoi Diagrams in the Lp-metric | Lee, D. T. | J. ACM 27, 604-618 | | | |
1998 | Two Guard Walkability of Simple Polygons | Tseng, L. H.; Lee, D. T. ; Heffernan, P. | International Journal of Computational Geometry and Applications 8, 85-116 | | | |
2005 | Two Variations of the Minimum Steiner Problem | Hsu, Tsan-Sheng ; Tsai, Kuo-Hui; Wang, Da-Wei ; Lee, D. T. | Journal of Combinatorial Optimization 9, 101-120 | | | |
1999 | Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization | Farrahi, A. H.; Lee, D. T. ; Sarrafzadeh, M. | Algorithmica 23, 187-210 | | | |