Chinese
English
Distinguished Research Fellow  |  Lee, Der- Tsai  
 
contact
vita
education
experience
interests
descriptions
activities
invited_talk
invited_visit
honors
publications
patents
supervised
Personal (New window)
lab (New window)
 
 
 
 
 
Publications
 
Journal Articles
 
1. Chung-Shou Liao and D. T. Lee, "Power Domination in Circular-arc Graphs," Algorithmica, volume 65, number 2, pages 443-466, February 2013, http://dx.doi.org/10.1007/s00453-011-9599-x :::icon :::icon
2. C. Wulff-Nilsen, A. Grüne, R. Klein, E. Langetepe, D.T. Lee, T.-C. Lin, S.-H. Poon, and T.-K. Yu, "Computing the Stretch Factor and Maximum Detour of Paths, Trees, and Cycles in the Normed Space," International Journal of Computational Geometry and Applications, volume 22, number 1, pages 45-60, February 2012.
3. M. J. Kao, C. S. Liao and D. T. Lee, "Capacitated domination problem," Algorithmica, volume 60, number 2, pages 274-300, July 2011. :::icon :::icon
4. T.-C. Lin and D. T. Lee, "Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem," Theoretical Comput. Sci., volume 411, number 7-9, pages 986-994, February 2010.
5. J. D. Wei, M. H. Tsai, G. C. Lee, J. H. Huang and D. T. Lee, "GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing," IEEE Transactions on Visualization and Computer Graphics, volume 15, number 2, pages pp. 234-248, March 2009. :::icon :::icon
6. D. T. Lee, T. C. Lin and H. I. Lu, "Fast Algorithms for the Density Finding Problem," Algorithmica, volume 53, number 3, pages 298--313, February 2009. :::icon :::icon
7. Te-Chin Chu, Tsunglin Liu, D.T. Lee, Greg C. Lee, and Arthur Chun-Chieh Shih, "GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events," Bioinformatics, volume 25, number 17, pages 2188-2193, 2009. :::icon
8. T. L. Huang and D. T. Lee, "A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks," Journal Parallel and Distributed Computing, volume 67, number 5, pages 516-530, May 2007. :::icon
9. T. C. Lin and D. T. Lee, "Randomized Algorithm for the Sum Selection Problem," Theoretical Comput. Sci., volume 377, number 1-3, pages 151-156, May 2007. :::icon :::icon
10. D. T. Lee, S. J. Shiah, C. M. Lee and Y. C. Wang, "State of Charge Estimation for Electric Scooters by Using Learning Mechanisms," IEEE Trans. Vehicular Technology, volume 56, number 2, pages 544-556, March 2007.
11. Arthur Chun-Chieh Shih, D.T. Lee, Chin-Lin Peng , and Yu-Wei Wu, "Phylo-mLogo: An interactive multiple-logo visualization tool for large-number sequence alignments," BMC Bioinformatics, volume 8:63, February 2007. :::icon
12. Chun-Nan Hsu, Jin-Mei Lai, Chia-Hung Liu,Huei-Hun Tseng, Chih-Yun Lin, Kuan-Ting Lin, Hsu-Hua Yeh, Ting-Yi Sung, Wen-Lian Hsu, Li-Jen Su, Sheng-An Lee, Chan-Han Chen, Gen-Cher Lee, D.T. Lee, Yow-Ling Shiue, Chang-Wei Yeh, Chao-Hui Chang, Cheng-Yan Kao, Chi-Ying F. Huang, "Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online)," BMC Bioinformatics, volume 8, number 66, pages 1471-2105, 2007.
13. T. L. Huang and D. T. Lee, "An iterative distributed algorithm for multi-constraint multicast routing," Computer Communications, volume 29, number 17, pages 3647-3661, November 2006.
14. Arthur Chun-Chieh Shih, D.T. Lee, Laurent Lin, Chin-Lin Peng , Shiang-Heng Chen, Yu-Wei Wu, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao, and Mu-Fen Hsieh, "SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools," BMC Bioinformatics, volume 7:103, pages 1471-2105, March 2006. :::icon
15. Jinn Ho, Wen-Liang Hwang, Henry Horn-Shing Lu, and D.T. Lee, "Gridding Spot Centers of Smoothly Distorted Microarray Images," IEEE Transactions on Image Processing, volume 15, number 2, pages 342-353, February 2006. :::icon
16. Y. C. Wang, C. J. Chien and D. T. Lee, "A Hybrid Adaptive Scheme of Fuzzy-Neural Iterative Learning Controller for Nonlinear Dynamic Systems," Int'l J. Fuzzy Systems, volume 7, number 4, pages 147-157, December 2005.
17. T. L. Huang and D. T. Lee, "Comments and an improvement on 'A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks'," IEEE/ACM Trans. Networking, volume 13, number 6, pages 1410-1411, December 2005.
18. Y. W. Huang, C. H. Tsai, T. P. Lin, S. K. Huang, D. T. Lee and S. Y. Kuo, "A testing framework for web application security assessment," Computer Networks, volume 48, number 5, pages 739-761, June 2005.
19. Y. S. Chen, D. T. Lee and C. S. Liao, "Labeling Points on a Single Line," International Journal of Computational Geometry and Applications, volume 15, number 3, pages 261-277, June 2005.
20. T. Y. Ho, Y. W. Chang, S. J. Chen and D. T. Lee, "Crosstalk- and performance-driven multilevel full-chip routing," IEEE Trans. Computer-Aided Design, volume 24, number 6, pages 869-878, June 2005.
21. T.-s. Hsu, K.-H. Tsai, D.-W. Wang, and D. T. Lee, "Two variations of the minimum," Journal of Combinatorial Optimization, volume 9, pages 101--120, 2005.
22. C. H. Wu, Jan-Ming Ho and D. T. Lee, "Travel Time Prediction with Support Vector Regression," IEEE Trans. Intelligent Transportation Systems, volume 5, number 4, pages 276-281, December 2004, its :::icon
23. E. Papadopoulou and D. T. Lee, "The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach," International Journal of Computational Geometry and Applications, volume 14, number 6, pages 421-452, December 2004.
24. T. K. Yu and D. T. Lee, "On the Crossing Distribution Problem in Two Regions," Journal of Information Science and Engineering, volume 20, number 1, pages 1-25, 2004.
25. H. C. Lai, J. S. Liu, L. S. Wang and D. T. Lee, "Design Parameters Study on the Stability and Perception of Riding Comfort of the Electrical Motorcycles under Rider Leaning," Mechatronics, volume 13, number 1, pages 49-76, February 2003. :::icon
26. D. T. Lee, G. C. Lee and Y. W. Huang, "Knowledge Management for Computational Problem Solving," Journal of Universal Computer Science, volume 9, number 6, pages 563-570, January 2003, also in Proc. 3rd Int'l Conference on Knowledge Management, Graz, Austria, July 2003
27. E. Papadopoulou and D. T. Lee, "The L∞ Voronoi Diagram of Segments and VLSI Applications," International Journal of Computational Geometry and Applications, volume 11, number 5, pages 503-528, October 2001.
28. S. M. Mok, C. H. Wu and D. T. Lee, "Modeling Automatic Assembly and Disassembly Operations for Virtual Manufacturing," IEEE Trans. on Systems, Man, and Cybernetics, PART A: Systems and Humans, volume 31, number 3, pages 223-232, May 2001.
29. K. Aoki and D. T. Lee, "Towards Web-Based Computing," International Journal of Computational Geometry and Applications, volume 11, number 1, pages 71-104, February 2001.
30. H. F. S. Chen and D. T. Lee, "A Faster One-Dimensional Topological Compaction Algorithm," Algorithmica, volume 28, number 4, pages 390-421, December 2000.
31. J. M. Ho, S. K. Huang, T. R. Chuang and D. T. Lee, "典藏數位化資訊環境之探討On Creation and Management of Digital Libraries: System Environment, Human-Computer Interface and Research Issues," J. Library & Information Science, volume 26, number 2, pages 38-48, October 2000.
32. J. Tao and D. T. Lee, "Computing and Combinatorics: Foreword," Theoretical Comput. Sci., volume 240, number 2, pages 255, June 2000.
33. M. G. Andrews, M. J. Atallah, D. Z. Chen and D. T. Lee, "Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems," Algorithmica, volume 26, number 2, pages 263-289, February 2000.
34. E. Papadopoulou and D. T. Lee, "Critical area computation via Voronoi diagrams," IEEE Trans. Computer-Aided Design, volume 18, number 4, pages 463-474, April 1999.
35. A. H. Farrahi, D. T. Lee and M. Sarrafzadeh, "Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization," Algorithmica, volume 23, number 3, pages 187-210, March 1999.
36. O. Aichholzer, F. Aurenhammer, D. Z. Chen, D. T. Lee and E. Papadopoulou, "Skew Voronoi Diagram," International Journal of Computational Geometry and Applications, volume 9, number 3, pages 235-247, January 1999.
37. D. Z. Chen, D. T. Lee, R. Sridhar and C. N. Sekharan, "Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs," Networks, volume 32, number 4, pages 249-257, December 1998.
38. H. F. S. Chen and D. T. Lee, "On Crossing Minimization Problem," IEEE Trans. Computer-Aided Design, volume 17, number 5, pages 406-418, May 1998.
39. E. Papadopoulou and D. T. Lee, "A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains," Algorithmica, volume 20, number 4, pages 319-352, April 1998.
40. D. T. Lee, C. F. Shen and S. M. Sheu, "GeoSheet: A Distributed Visualization Tool for Geometric Algorithms," International Journal of Computational Geometry and Applications, volume 8, number 2, pages 119-155, April 1998.
41. L. H. Tseng, D. T. Lee and P. Heffernan, "Two Guard Walkability of Simple Polygons," International Journal of Computational Geometry and Applications, volume 8, number 1, pages 85-116, February 1998.
42. D. T. Lee, C. D. Yang and C. K. Wong, "Finding Rectilinear Paths Among Obstacles in a Two-layer Interconnection Model," International Journal of Computational Geometry and Applications, volume 7, number 6, pages 581-598, December 1997.
43. C. D. Yang, D. T. Lee and C. K. Wong, "The Smallest Pair of Non-crossing Paths in a Rectilinear Polygon," IEEE Trans. Comput., volume 46, number 8, pages 930-941, August 1997.
44. K. H. Tsai and D. T. Lee, "K-best Cuts for Circular-arc Graphs," Algorithmica, volume 18, number 2, pages 198-216, June 1997.
45. D. T. Lee, C. D. Yang and C. K. Wong, "Rectilinear Paths Among Rectilinear Obstacles," Discrete Applied Mathematics, volume 70, number 3, pages 185-215, October 1996.
46. D. T. Lee, "Computational Geometry," ACM Computing Surveys, volume 28, number 1, pages 27-31, March 1996, invited paper
47. H. F. S. Chen and D. T. Lee, "A Faster Algorithm for Rubber-band Equivalent Transformation for Planar VLSI Layouts," IEEE Trans. Computer-Aided Design, volume 15, number 2, pages 217-227, February 1996.
48. K. Swanson, D. T. Lee and V. L. Wu, "An Optimal Algorithm for Roundness Determination on Convex Polygons," Computational Geometry: Theory and Applications, volume 5, number 4, pages 225-235, November 1995.
49. M. J. Atallah, D. Z. Chen and D. T. Lee, "An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications," Algorithmica, volume 14, number 5, pages 429-441, November 1995.
50. M. H. Alsuwaiyel and D. T. Lee, "Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon," Info. Processing Letters, volume 55, pages 75-79, July 1995.
51. C. D. Yang, D. T. Lee and C. K. Wong, "Rectilinear Path Problems among Rectilinear Obstacles Revisited," SIAM J. Computing, volume 24, number 3, pages 457-472, June 1995.
52. P. J. deRezende and D. T. Lee, "Dot Pattern Matching in d-Dimensions," Algorithmica, volume 13, number 4, pages 387-404, April 1995.
53. M. G. Andrews and D. T. Lee, "Parallel Algorithms on Circular-Arc Graphs," Computational Geometry: Theory and Applications, volume 5, number 3, pages 117-141, 1995.
54. D. T. Lee, C. D. Yang and C. K. Wong, "On Bends and Distances of Paths among Obstacles in Two-Layer Interconnection Model," IEEE Trans. Comput., volume 43, number 6, pages 711-724, June 1994.
55. M. Sarrafzadeh and D. T. Lee, "Restricted Track Assignment with Applications," International Journal of Computational Geometry and Applications, volume 4, number 1, pages 53-68, March 1994.
56. D. T. Lee and M. Sarrafzadeh, "Maximum Independent Set of a Permutation Graph in K Tracks," International Journal of Computational Geometry and Applications, volume 3, number 3, pages 291-304, September 1993.
57. M. H. Alsuwaiyel and D. T. Lee, "Minimal Link Visibility Paths inside a Simple Polygon," Computational Geometry: Theory and Applications, volume 3, number 1, pages 1-26, June 1993.
58. D. T. Lee and E. Papadopoulou, "The All-Pairs-Quickest Path Problem," Info. Processing Letters, volume 45, number 5, pages 261-267, April 1993.
59. R. D. Lou, M. Sarrafzadeh and D. T. Lee, "An Optimal Algorithm for the Maximum Two-Chain Problem," SIAM J. Discrete Algorithms, volume 5, number 2, pages 285-304, May 1992.
60. C. D. Yang, D. T. Lee and C. K. Wong, "On Bends and Length of Rectilinear Paths: A Graph-Theoretic Approach," International Journal of Computational Geometry and Applications, volume 2, number 1, pages 61-74, March 1992.
61. C. S. Jeong, J. J. Choi and D. T. Lee, "Parallel Enclosing Rectangle on SIMD Machines," Parallel Computing, volume 18, number 2, pages 21-229, 1992.
62. H. Imai, D. T. Lee and C. D. Yang, "1-segment Center Problems," ORSA J. Computing., volume 4, number 4, pages 426-434, 1992.
63. M. Sarrafzadeh and D. T. Lee, "Topological Via Minimization Revisited," IEEE Trans. Comput., volume 40, number 11, pages 1307-1312, November 1991.
64. D. T. Lee, C. D. Yang and T. H. Chen, "Shortest Rectilinear Paths among Weighted Obstacles," International Journal of Computational Geometry and Applications, volume 1, number 2, pages 109-124, June 1991.
65. V. B. Le and D. T. Lee, "Out-of-Roundness Problem Revisited," IEEE Trans. Pattern Analysis & Machine Intelligence, volume 13, number 3, pages 217-223, March 1991.
66. Jan-Ming Ho, D. T. Lee, C. H. Chang and C. K. Wong, "Minimum Diameter Spanning Trees and Related Problems," SIAM J. on Computin, volume 20, number 5, pages 987-997, January 1991, cg
67. D. T. Lee, M. Sarrafzadeh and Y. F. Wu, "Minimum Cut for Circular-arc Graphs," SIAM J. Computing, volume 19, number 6, pages 1041-1050, December 1990.
68. K. F. Liao, D. T. Lee and M. Sarrafzadeh, "Planar Subset of Multi-terminal Nets," Integration, the VLSI Journal, volume 10, number 1, pages 19-37, September 1990.
69. C. D. Yang, T. H. Chen and D. T. Lee, "Shortest Rectilinear Paths among Weighted Rectangles," J. Information Processing, volume 13, number 4, pages 456-462, 1990.
70. C. S. Jeong and D. T. Lee, "Parallel Geometric Algorithms on a Mesh Connected Computer," Algorithmica, volume 5, number 2, pages 155-177, 1990.
71. D. T. Lee, F. P. Preparata, "Parallel Batched Planar Point Location on the CCC," Info. Processing Letters, volume 33, number 4, pages 175-179, December 1989.
72. P. Ramanan, D. J. Brown, C. C. Lee and D. T. Lee, "On-Line Bin Packing in Linear Time," J. Algorithms, volume 10, number 3, pages 305-326, September 1989.
73. M. Sarrafzadeh and D.T. Lee, "A New Approach to Topological Via Minimization," IEEE Trans. Computer-Aided Design, volume 8, number 8, pages 890-900, August 1989.
74. P. J. de Rezende, D. T. Lee and Y. F. Wu, "Rectilinear Shortest Paths with Rectangular Barriers," Discrete & Comput. Geom., volume 4, number 1, pages 41-53, 1989.
75. T. M. Nicholl, P. T. Lee and R. A. Nicholl, "An Efficient New Algorithm for 2D line Clipping: Its Development and Analysis," ACM SIGGRAPH Computer Graphics, volume 21, number 4, pages 253-262, July 1987.
76. C. C. Lee, D. T. Lee and C. K. Wong, "Generating Binary Trees of Bounded Height," Acta Informatica, volume 23, number 5, pages 529-544, September 1986.
77. D. T. Lee and A. K. Lin, "Computing the Visibility Polygon from an Edge," Computer Vision, Graphics, and Image Processing , volume 34, number 1, pages 1-19, April 1986.
78. D. T. Lee and Y. F. Wu, "Geometric Complexity of Some Location Problems," Algorithmica, volume 1, number 1, pages 193-211, March 1986.
79. D. T. Lee and A. K. Lin, "Computational Complexity of Art Gallery Problems," IEEE Trans. Infor. Theory, volume 32, number 2, pages 276-282, March 1986.
80. B. Chazelle, R. L. Drysdale and D. T. Lee, "Computing the Largest Empty Rectangle," SIAM J. Computing, volume 15, number 1, pages 300-315, 1986.
81. B. M. Chazelle and D. T. Lee, "On a Circle Placement Problem," Computing, volume 36, number 1-2, pages 1-16, 1986.
82. D. T. Lee and A. K. Lin, "Generalized Delaunay Triangulation for Planar Graphs," Discrete & Comput. Geom., volume 1, number 1, pages 201-217, 1986.
83. C. C. Lee and D. T. Lee, "A Simple On-Line Bin Packing Algorithm," J. ACM, volume 32, number 3, pages 562-572, July 1985.
84. D. T. Lee, "Computing the Relative Neighborhood Graph in the L1-metric," Pattern Recognition, volume 18, number 5, pages 327-332, 1985.
85. Y. T. Ching and D. T. Lee, "On Finding the Diameter of a Set of Lines," Pattern Recognition, volume 18, number 3-4, pages 249-255, 1985.
86. B. Chazelle, L. J. Guibas and D. T. Lee, "The Power of Geometric Duality," BIT, volume 25, number 1, pages 76-90, 1985.
87. D. T. Lee and Y. T. Ching, "The Power of Geometric Duality Revisited," Info. Processing Letters, volume 21, number 3, pages 117-122, 1985.
88. D. T. Lee and F. P. Preparata, "Computational Geometry: A Survey," IEEE Trans. Comput., volume 33, number 12, pages 1072-1101, December 1984.
89. C. C. Lee and D. T. Lee, "On a Circle-Cover Minimization Problem," Info. Processing Letters, volume 18, number 2, pages 109-115, February 1984.
90. D. T. Lee, "An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems," Int'l J. Comput. and Info. Sci., volume 13, number 1, pages 23-32, February 1984.
91. D. T. Lee and J. Y. T. Leung, "On 2-Dimensional Channel Assignment Problem," IEEE Trans. Comput., volume 33, number 1, pages 2-6, January 1984.
92. D. T. Lee and F. P. Preparata, "Euclidean Shortest Paths in the Presence of Rectilinear Barriers," Networks, volume 14, pages 393-410, 1984.
93. D. Y. Yeh and D. T. Lee, "Graph Algorithms on a Tree-Structured Parallel Computer," BIT, volume 24, number 3, pages 333-340, 1984.
94. A. Naamad, W. L. Hsu and D. T. Lee, "On Maximum Empty Rectangle Problem," Discrete Applied Mathematics, volume 8, pages 267-277, 1984.
95. T. M. Nicholl, D. T. Lee, Y. Z. Liao and C. K. Wong, "On the X-Y Convex Hull of a Set of X-Y polygons," BIT, volume 23, number 4, pages 456-471, December 1983.
96. I. G. Gowda, D. G. Kirkpatrick, D. T. Lee and A. Naamad, "Dynamic Voronoi Diagrams," IEEE Trans. Infor. Theory, volume 29, number 5, pages 724-731, September 1983.
97. D. T. Lee, "Visibility of a Simple Polygon," Computer Vision, Graphics, and Image Processing , volume 22, number 2, pages 207-221, May 1983.
98. D. T. Lee, "On Finding the Convex Hull of a Simple Polygon," Int'l J. Comput. and Info. Sci., volume 12, number 2, pages 87-98, April 1983.
99. U. I. Gupta, D. T. Lee and C. K. Wong, "Ranking and Unranking of B-Trees," J. Algorithms, volume 4, number 1, pages 51-60, March 1983.
100. D. T. Lee, C. L. Liu and C. K. Wong, "(g0, g1,..., gk)-Trees and Unary 0L Systems," Theoretical Comput. Sci., volume 22, number 1-2, pages 209-217, January 1983.
101. D. T. Lee and C. B. Silio Jr, "An Optimal Illumination Region Algorithm for Convex Polygons," IEEE Trans. Comput., volume 31, number 12, pages 1225-1227, December 1982.
102. D. T. Lee and F. P. Preparata, "An Improved Algorithm for the Rectangle Enclosure Problem," J. Algorithms, volume 3, number 3, pages 218-224, September 1982.
103. U. I. Gupta, D. T. Lee and C. K. Wong, "Ranking and Unranking of 2-3 Trees," SIAM J. Computing, volume 11, number 3, pages 582-590, August 1982.
104. D. T. Lee, "Medial Axis Transformation of a Planar Shape," IEEE Trans. Pattern Analysis & Machine Intelligence, volume 4, number 4, pages 363-369, July 1982.
105. D. T. Lee, "On k-Nearest Neighbor Voronoi Diagrams in the Plane," IEEE Trans. Comput., volume 31, number 6, pages 478-487, June 1982.
106. U. I. Gupta, D. T. Lee and J. Y. T. Leung, "Efficient Algorithms for Interval Graphs and Circular-arc Graphs," Networks, volume 12, pages 459-467, 1982.
107. D. T. Lee, S. J. Hong and C. K. Wong, "Number of Vias: A Control Parameter for Global Wiring of High Density Chips," IBM J. Res. and Develop., volume 25, number 4, pages 261-271, July 1981.
108. D. T. Lee, H. Chang and C. K. Wong, "An On-Chip Compare/Steer Bubble Sorter," IEEE Trans. Comput., volume 30, number 6, pages 396-405, June 1981.
109. D. T. Lee and R. L. Drysdale, "Generalization of Voronoi Diagram in the Plane," SIAM J. Computing, volume 10, number 1, pages 73-87, February 1981.
110. D. T. Lee and C. K. Wong, "Finding Intersection of Rectangles by Range Search," J. Algorithms, volume 2, number 4, pages 337-347, 1981.
111. U. I. Gupta, D. T. Lee, J. Y. T. Leung, J. W. Pruitt and C. K. Wong, "Record Allocation for Minimizing Expected Seek Delay Time," Theoretical Comput. Sci., volume 16, pages 307-319, 1981.
112. J. M. Smith, D. T. Lee and J. S. Liebman, "An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric," Networks, volume 11, number 1, pages 23-29, 1981.
113. D. T. Lee, "Two Dimensional Voronoi Diagrams in the Lp-metric," J. ACM, volume 27, number 4, pages 604-618, October 1980.
114. D. T. Lee and C. K. Wong, "Quintary Trees: A File Structure for Multidimensional Database Systems," ACM Trans. Database System, volume 1, number 3, pages 339-353, September 1980.
115. D. T. Lee and B. J. Schacter, "Two Algorithms for Constructing Delaunay Triangulations," Int'l J. Comput. and Info. Sci., volume 9, number 3, pages 219-242, June 1980.
116. D. T. Lee and C. K. Wong, "Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage Applications," SIAM J. Computing, volume 9, number 1, pages 200-211, February 1980.
117. J. M. Smith, D. T. Lee and J. S. Liebman, "An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem," Engineering Optimization, volume 4, number 4, pages 179-192, 1980.
118. U. I. Gupta, D. T. Lee and J. Y.T. Leung, "An Optimal Solution for the Channel-Assignment Problem," IEEE Trans. Comput., volume 28, number 11, pages 807-810, November 1979.
119. D. T. Lee and C. C. Yang, "Location of Multiple Points in Planar Subdivision," Info. Processing Letters, volume 9, number 4, pages 190-193, November 1979.
120. D. T. Lee and F. P. Preparata, "An Optimal Algorithm for Finding the Kernel of a polygon," J. ACM, volume 26, number 3, pages 415-421, July 1979.
121. C. C. Yang and D. T. Lee, "A Note on the All Nearest Neighbor Problem for Convex Polygons," Info. Processing Letters, volume 8, number 4, pages 193-194, April 1979.
122. D. T. Lee and F. P. Preparata, "The All Nearest Neighbor Problem for Convex Polygons," Info. Processing Letters, volume 7, number 4, pages 189-192, June 1978.
123. D. T. Lee and F. P. Preparata, "Location of a Point in a Planar Subdivision and Its Applications," SIAM J. Computing, volume 6, number 3, pages 594-606, September 1977.
124. D. T. Lee and C. K. Wong, "Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees," Acta Informatica, volume 9, pages 23-29, 1977.
125. D. T. Lee and S. J. Hong, "An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function," IEEE Trans. Comput., volume 25, number 11, pages 1117-1123, November 1976.
 
 
 
 
 
 
bg