第 1 到 102 筆結果,共 102 筆。
公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 1999 | Critical area computation via Voronoi diagrams | Papadopoulou, E.; Lee, D. T. | IEEE Trans. Computer-Aided Design 18, 463-474 | |||
2 | 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 | |||
3 | 1999 | Skew Voronoi Diagram | Aichholzer, O.; Aurenhammer, F.; Chen, D. Z.; Lee, D. T. ; Papadopoulou, E. | International Journal of Computational Geometry and Applications 9, 235-247 | |||
4 | 1999 | A Muscular-like Compliance Control for Active Vehicle Suspension | Chang, S. L.; Wu, C. H.; Lee, D. T. | ||||
5 | 1998 | Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs | Chen, D. Z.; Lee, D. T. ; Sridhar, R.; Sekharan, C. N. | Networks 32, 249-257 | |||
6 | 1998 | On Crossing Minimization Problem | Chen, H. F. S.; Lee, D. T. | IEEE Trans. Computer-Aided Design 17, 406-418 | |||
7 | 1998 | GeoSheet: A Distributed Visualization Tool for Geometric Algorithms | Lee, D. T. ; Shen, C. F.; Sheu, S. M. | International Journal of Computational Geometry and Applications 8, 119-155 | |||
8 | 1998 | A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains | Papadopoulou, E.; Lee, D. T. | Algorithmica 20, 319-352 | |||
9 | 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 | |||
10 | 1997 | Finding Rectilinear Paths Among Obstacles in a Two-layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | International Journal of Computational Geometry and Applications 7, 581-598 | |||
11 | 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 | |||
12 | 1997 | K-best Cuts for Circular-arc Graphs | Tsai, K. H.; Lee, D. T. | Algorithmica 18, 198-216 | |||
13 | 1996 | The Steiner Minimal Tree Problem in the λ-geometry Plane | Lee, D. T. ; Shen, C. F. | ||||
14 | 1996 | Rectilinear Paths Among Rectilinear Obstacles | Lee, D. T. ; Yang, C. D.; Wong, C. K. | Discrete Applied Mathematics 70, 185-215 | |||
15 | 1996 | Steiner Problems on Directed Acyclic Graphs | Tsan-sheng Hsu ; Kuo-Hui Tsai; Da-Wei Wang ; D.T. Lee | ||||
16 | 1996 | Computational Geometry | Lee, D. T. | ACM Computing Surveys 28(1), 27-31 | |||
17 | 1996 | A Faster Algorithm for Rubber-band Equivalent Transformation for Planar VLSI Layouts | Chen, H. F. S.; Lee, D. T. | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(2), 217-227 | |||
18 | 1996 | A Study of Neuromuscular-like Control in Rehabilitation Robot | Wu, C. H.; Chang, S. L.; Lee, D. T. | ||||
19 | 1996 | Steiner Problem on Directed Acyclic Graphs | Hsu, T. S.; Tsai, K. H.; Wang, D. W.; Lee, D. T. | ||||
20 | 1995 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications | Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 14, 429-441 | |||
21 | 1995 | An Optimal Algorithm for Roundness Determination on Convex Polygons | Swanson, K.; Lee, D. T. ; Wu, V. L. | Computational Geometry: Theory and Applications 5, 225-235 | |||
22 | 1995 | Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon | Alsuwaiyel, M. H.; Lee, D. T. | Info. Processing Letters 55, 75-79 | |||
23 | 1995 | Rectilinear Path Problems among Rectilinear Obstacles Revisited | Yang, C. D.; Lee, D. T. ; Wong, C. K. | SIAM J. Computing 24, 457-472 | |||
24 | 1995 | On Steiner Tree Problem with 45° Routing | Lee, D. T. ; Shen, C. F.; Ding, C. L. | ||||
25 | 1995 | Point Set pattern matching ind-dimensions | deRezende, P. J.; Lee, D. T. | Algorithmica 13, 387-404 | |||
26 | 1995 | Parallel Algorithms on Circular-Arc Graphs | Andrews, M. G.; Lee, D. T. | Computational Geometry: Theory and Applications 5, 117-141 | |||
27 | 1994 | On Bends and Distances of Paths among Obstacles in Two-Layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | IEEE Trans. Comput. 43, 711-724 | |||
28 | 1994 | Restricted Track Assignment with Applications | Sarrafzadeh, M.; Lee, D. T. | International Journal of Computational Geometry and Applications 4, 53-68 | |||
29 | 1993 | Maximum Independent Set of a Permutation Graph in K Tracks | Lee, D. T. ; Sarrafzadeh, M. | International Journal of Computational Geometry & Applications 3(3), 291-304 | |||
30 | 1993 | Minimum Spanning Trees with Bounded Number of Bends | Ho, Jan-Ming ; Lee, D. T. ; Wong, C. K. | ||||
31 | 1993 | Minimal Link Visibility Paths inside a Simple Polygon | Alsuwaiyel, M. H.; D. T. Lee | Computational Geometry: Theory and Applications 3, 1-26 | |||
32 | 1993 | The All-Pairs-Quickest Path Problem | Lee, D. T. ; Papadopoulou, E. | Info. Processing Letters 45, 261-267 | |||
33 | 1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | |||
34 | 1992 | On Bends and Length of Rectilinear Paths: A Graph-Theoretic Approach | Yang, C. D.; Lee, D. T. ; Wong, C. K. | International Journal of Computational Geometry and Applications 2, 61-74 | |||
35 | 1992 | 1-segment Center Problems | Imai, H.; Lee, D. T. ; Yang, C. D. | ORSA J. Computing. 4, 426-434 | |||
36 | 1992 | Parallel Enclosing Rectangle on SIMD Machines | Jeong, C. S.; Choi, J. J.; Lee, D. T. | Parallel Computing 18, 21-229 | |||
37 | 1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | |||
38 | 1991 | Minimum Diameter Spanning Trees and Related Problems | Ho, Jan-Ming ; Lee, D. T. ; Chang, C. H.; Wong, C. K. | SIAM Journal on Computing 20(5), 987-997 | |||
39 | 1991 | Shortest Rectilinear Paths among Weighted Obstacles | Lee, D. T. ; Yang, C. D.; Chen, T. H. | International Journal of Computational Geometry and Applications 1, 109-124 | |||
40 | 1991 | Out-of-Roundness Problem Revisited | Le, V. B.; Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 13, 217-223 | |||
41 | 1990 | Minimum Cut for Circular-arc Graphs | Lee, D. T. ; Sarrafzadeh, M.; Wu, Y. F. | SIAM J. Computing 19, 1041-1050 | |||
42 | 1990 | Planar Subset of Multi-terminal Nets | Liao, K. F.; Lee, D. T. ; Sarrafzadeh, M. | Integration, the VLSI Journal 10, 19-37 | |||
43 | 1990 | Parallel Geometric Algorithms on a Mesh Connected Computer | Jeong, C. S.; Lee, D. T. | Algorithmica 5, 155-177 | |||
44 | 1990 | Shortest Rectilinear Paths among Weighted Rectangles | Yang, C. D.; Chen, T. H.; Lee, D. T. | J. Information Processing 13, 456-462 | |||
45 | 1989 | Parallel Batched Planar Point Location on the CCC | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 33, 175-179 | |||
46 | 1989 | Minimum Delay Networks | Ho, Jan-Ming ; Lee, D. T. | ||||
47 | 1989 | On-Line Bin Packing in Linear Time | Ramanan, P.; Brown, D. J.; Lee, C. C.; Lee, D. T. | J. Algorithms 10, 305-326 | |||
48 | 1989 | A New Approach to Topological Via Minimization | Sarrafzadeh, M.; Lee, D. T. | IEEE Trans. Computer-Aided Design 8, 890-900 | |||
49 | 1989 | Rectilinear Shortest Paths with Rectangular Barriers | de Rezende, P. J.; Lee, D. T. ; Wu, Y. F. | Discrete & Computational Geometry 4, 41-53 | |||
50 | 1987 | An efficient new algorithm for 2-D line clipping: Its development and analysis | Nicholl, T. M.; Lee, D. T. ; Nicholl, R. A. | ACM SIGGRAPH Computer Graphics 21(4), 253-262 | |||
51 | 1986 | Geometric Complexity of Some Location Problems | Lee, D. T. ; Wu, Y. F. | Algorithmica 1, 193 | |||
52 | 1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | |||
53 | 1986 | Computing the Visibility Polygon from an Edge | Lee, D. T. ; Lin, A. K. | Computer Vision, Graphics, and Image Processing 34(1), 1-19 | |||
54 | 1986 | Computational Complexity of Art Gallery Problems | Lee, D. T. ; Lin, A. K. | IEEE Transactions on Information Theory 32(2), 276-282 | |||
55 | 1986 | Computing the Largest Empty Rectangle | Chazelle, B.; Drysdale, R. L.; Lee, D. T. | SIAM J. Computing 15, 300-315 | |||
56 | 1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 | |||
57 | 1986 | Generalized Delaunay Triangulation for Planar Graphs | Lee, D. T. ; Lin, A. K. | Discrete & Computational Geometry 1, 201-217 | |||
58 | 1985 | A Simple On-Line Bin Packing Algorithm | Lee, C. C.; Lee, D. T. | J. ACM 32, 562-572 | |||
59 | 1985 | Geometric Complexity and Related Problems | Lee, D. T. | TR-85-001 | |||
60 | 1985 | A Linear Time Algorithm for Partitioning a Set of Points in the Plane | Ching, Y. T.; Lee, D. T. | TR-85-002 | |||
61 | 1985 | The Power of Geometric Duality | Chazelle, B.; Guibas, L. J.; Lee, D. T. | BIT 25, 76-90 | |||
62 | 1985 | Finding the diameter of a set of lines | Ching, Y. T.; Lee, D. T. | Pattern Recognition 18(3-4), 249-255 | |||
63 | 1985 | The Power of Geometric Duality Revisited | Lee, D. T. ; Ching, Y. T. | Info. Processing Letters 21, 117-122 | |||
64 | 1985 | Computing the Relative Neighborhood Graph in the L1-metric | Lee, D. T. | Pattern Recognition 18, 327-332 | |||
65 | 1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | |||
66 | 1984 | On a Circle-Cover Minimization Problem | Lee, C. C.; Lee, D. T. | Info. Processing Letters 18 | |||
67 | 1984 | An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems | Lee, D. T. | International Journal of Computer & Information Sciences 13, 23-32 | |||
68 | 1984 | On 2-Dimensional Channel Assignment Problem | Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 33, 2-6 | |||
69 | 1984 | Graph Algorithms on a Tree-Structured Parallel Computer | Yeh, D. Y.; Lee, D. T. | BIT 24, 333-340 | |||
70 | 1984 | On the maximum empty rectangle problem | Naamad, A.; Lee, D. T. ; Hsu, W. L. | Discrete Applied Mathematics 8(3), 267-277 | |||
71 | 1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | |||
72 | 1983 | On the X-Y Convex Hull of a Set of X-Y polygons | Nicholl, T. M.; Lee, D. T. ; Liao, Y. Z.; Wong, C. K. | BIT 23, 456-471 | |||
73 | 1983 | Dynamic Voronoi Diagrams | Gowda, I. G.; Kirkpatrick, D. G.; Lee, D. T. ; Naamad, A. | IEEE Trans. Infor. Theory 29, 724-731 | |||
74 | 1983 | Visibility of a Simple Polygon | Lee, D. T. | Computer Vision, Graphics, and Image Processing 22, 207-221 | |||
75 | 1983 | On Finding the Convex Hull of a Simple Polygon | Lee, D. T. | International Journal of Computer & Information Sciences 12, 87-98 | |||
76 | 1983 | Ranking and Unranking of B-Trees | Gupta, U. I.; Lee, D. T. ; Wong, C. K. | J. Algorithms 4, 51-60 | |||
77 | 1983 | (g0, g1,..., gk)-Trees and Unary 0L Systems | Lee, D. T. ; Liu, C. L.; Wong, C. K. | Theoretical Comput. Sci. 22, 209-217 | |||
78 | 1982 | An Optimal Illumination Region Algorithm for Convex Polygons | Lee, D. T. ; Silio Jr, C. B. | IEEE Transactions on Computers 31(12), 225-1227 | |||
79 | 1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | |||
80 | 1982 | Ranking and Unranking of 2-3 Trees | Gupta, U. I.; Lee, D. T. ; Wong, C. K. | SIAM Journal on Computing 11(3), 582-590 | |||
81 | 1982 | Medial Axis Transformation of a Planar Shape | Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 4, 363-369 | |||
82 | 1982 | On k-Nearest Neighbor Voronoi Diagrams in the Plane | Lee, D. T. | IEEE Trans. Comput. 31, 478-487 | |||
83 | 1982 | Efficient Algorithms for Interval Graphs and Circular-arc Graphs | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | Networks 12(4), 459-467 | |||
84 | 1981 | Number of Vias: A Control Parameter for Global Wiring of High Density Chips | Lee, D. T. ; Hong, S. J.; Wong, C. K. | IBM J. Res. and Develop. 25, 261-271 | |||
85 | 1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | |||
86 | 1981 | Generalization of Voronoi Diagram in the Plane | Lee, D. T. ; Drysdale, R. L. | SIAM J. Computing 10, 73-87 | |||
87 | 1981 | Record Allocation for Minimizing Expected Seek Delay Time | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T.; Pruitt, J. W.; Wong, C. K. | Theoretical Comput. Sci. 16, 307-319 | |||
88 | 1981 | An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Networks 11, 23-29 | |||
89 | 1981 | Finding Intersection of Rectangles by Range Search | Lee, D. T. ; Wong, C. K. | J. Algorithms 2, 337-347 | |||
90 | 1980 | Two Dimensional Voronoi Diagrams in the Lp-metric | Lee, D. T. | J. ACM 27, 604-618 | |||
91 | 1980 | Quintary Trees: A File Structure for Multidimensional Database Systems | Lee, D. T. ; Wong, C. K. | ACM Transactions on Database Systems 5(3), 339-353 | |||
92 | 1980 | Two Algorithms for Constructing Delaunay Triangulations | Lee, D. T. ; Schacter, B. J. | International Journal of Computer & Information Sciences 9, 219-242 | |||
93 | 1980 | Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage Applications | Lee, D. T. ; Wong, C. K. | SIAM J. Computing 9, 200-211 | |||
94 | 1980 | An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Engineering Optimization 4, 179-192 | |||
95 | 1979 | Location of Multiple Points in Planar Subdivision | Lee, D. T. ; Yang, C. C. | Information Processing Letters 9(4), 190-193 | |||
96 | 1979 | An Optimal Solution for the Channel-Assignment Problem | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 28, 807-810 | |||
97 | 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | |||
98 | 1979 | A Note on the All Nearest Neighbor Problem for Convex Polygons | Yang, C. C.; Lee, D. T. | Information Processing Letters 8(4), 193-194 | |||
99 | 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | |||
100 | 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 | |||
101 | 1977 | Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees | Lee, D. T. ; Wong, C. K. | Acta Informatica 9, 23-29 | |||
102 | 1976 | An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function | Lee, D. T. ; Hong, S. J. | IEEE Trans. Comput. 25, 1117-1123 |