Results 1-50 of 50 (Search time: 0.004 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 1989 | Parallel Batched Planar Point Location on the CCC | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 33, 175-179 | |||
2 | 1989 | Minimum Delay Networks | Ho, Jan-Ming ; Lee, D. T. | ||||
3 | 1989 | On-Line Bin Packing in Linear Time | Ramanan, P.; Brown, D. J.; Lee, C. C.; Lee, D. T. | J. Algorithms 10, 305-326 | |||
4 | 1989 | A New Approach to Topological Via Minimization | Sarrafzadeh, M.; Lee, D. T. | IEEE Trans. Computer-Aided Design 8, 890-900 | |||
5 | 1989 | Rectilinear Shortest Paths with Rectangular Barriers | de Rezende, P. J.; Lee, D. T. ; Wu, Y. F. | Discrete & Computational Geometry 4, 41-53 | |||
6 | 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 | |||
7 | 1986 | Geometric Complexity of Some Location Problems | Lee, D. T. ; Wu, Y. F. | Algorithmica 1, 193 | |||
8 | 1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | |||
9 | 1986 | Computing the Visibility Polygon from an Edge | Lee, D. T. ; Lin, A. K. | Computer Vision, Graphics, and Image Processing 34(1), 1-19 | |||
10 | 1986 | Computational Complexity of Art Gallery Problems | Lee, D. T. ; Lin, A. K. | IEEE Transactions on Information Theory 32(2), 276-282 | |||
11 | 1986 | Generalized Delaunay Triangulation for Planar Graphs | Lee, D. T. ; Lin, A. K. | Discrete & Computational Geometry 1, 201-217 | |||
12 | 1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 | |||
13 | 1986 | Computing the Largest Empty Rectangle | Chazelle, B.; Drysdale, R. L.; Lee, D. T. | SIAM J. Computing 15, 300-315 | |||
14 | 1985 | A Simple On-Line Bin Packing Algorithm | Lee, C. C.; Lee, D. T. | J. ACM 32, 562-572 | |||
15 | 1985 | Geometric Complexity and Related Problems | Lee, D. T. | TR-85-001 | |||
16 | 1985 | A Linear Time Algorithm for Partitioning a Set of Points in the Plane | Ching, Y. T.; Lee, D. T. | TR-85-002 | |||
17 | 1985 | The Power of Geometric Duality | Chazelle, B.; Guibas, L. J.; Lee, D. T. | BIT 25, 76-90 | |||
18 | 1985 | Finding the diameter of a set of lines | Ching, Y. T.; Lee, D. T. | Pattern Recognition 18(3-4), 249-255 | |||
19 | 1985 | The Power of Geometric Duality Revisited | Lee, D. T. ; Ching, Y. T. | Info. Processing Letters 21, 117-122 | |||
20 | 1985 | Computing the Relative Neighborhood Graph in the L1-metric | Lee, D. T. | Pattern Recognition 18, 327-332 | |||
21 | 1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | |||
22 | 1984 | On a Circle-Cover Minimization Problem | Lee, C. C.; Lee, D. T. | Info. Processing Letters 18 | |||
23 | 1984 | An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems | Lee, D. T. | International Journal of Computer & Information Sciences 13, 23-32 | |||
24 | 1984 | On 2-Dimensional Channel Assignment Problem | Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 33, 2-6 | |||
25 | 1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | |||
26 | 1984 | Graph Algorithms on a Tree-Structured Parallel Computer | Yeh, D. Y.; Lee, D. T. | BIT 24, 333-340 | |||
27 | 1984 | On the maximum empty rectangle problem | Naamad, A.; Lee, D. T. ; Hsu, W. L. | Discrete Applied Mathematics 8(3), 267-277 | |||
28 | 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 | |||
29 | 1983 | Dynamic Voronoi Diagrams | Gowda, I. G.; Kirkpatrick, D. G.; Lee, D. T. ; Naamad, A. | IEEE Trans. Infor. Theory 29, 724-731 | |||
30 | 1983 | Visibility of a Simple Polygon | Lee, D. T. | Computer Vision, Graphics, and Image Processing 22, 207-221 | |||
31 | 1983 | On Finding the Convex Hull of a Simple Polygon | Lee, D. T. | International Journal of Computer & Information Sciences 12, 87-98 | |||
32 | 1983 | Ranking and Unranking of B-Trees | Gupta, U. I.; Lee, D. T. ; Wong, C. K. | J. Algorithms 4, 51-60 | |||
33 | 1983 | (g0, g1,..., gk)-Trees and Unary 0L Systems | Lee, D. T. ; Liu, C. L.; Wong, C. K. | Theoretical Comput. Sci. 22, 209-217 | |||
34 | 1982 | An Optimal Illumination Region Algorithm for Convex Polygons | Lee, D. T. ; Silio Jr, C. B. | IEEE Transactions on Computers 31(12), 225-1227 | |||
35 | 1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | |||
36 | 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 | |||
37 | 1982 | Medial Axis Transformation of a Planar Shape | Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 4, 363-369 | |||
38 | 1982 | On k-Nearest Neighbor Voronoi Diagrams in the Plane | Lee, D. T. | IEEE Trans. Comput. 31, 478-487 | |||
39 | 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 | |||
40 | 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 | |||
41 | 1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | |||
42 | 1981 | Generalization of Voronoi Diagram in the Plane | Lee, D. T. ; Drysdale, R. L. | SIAM J. Computing 10, 73-87 | |||
43 | 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 | |||
44 | 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 | |||
45 | 1981 | Finding Intersection of Rectangles by Range Search | Lee, D. T. ; Wong, C. K. | J. Algorithms 2, 337-347 | |||
46 | 1980 | Two Dimensional Voronoi Diagrams in the Lp-metric | Lee, D. T. | J. ACM 27, 604-618 | |||
47 | 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 | |||
48 | 1980 | Two Algorithms for Constructing Delaunay Triangulations | Lee, D. T. ; Schacter, B. J. | International Journal of Computer & Information Sciences 9, 219-242 | |||
49 | 1980 | Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage Applications | Lee, D. T. ; Wong, C. K. | SIAM J. Computing 9, 200-211 | |||
50 | 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 |