Results 1-7 of 7 (Search time: 0.002 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 1986 | Geometric Complexity of Some Location Problems | Lee, D. T. ; Wu, Y. F. | Algorithmica 1, 193 | |||
2 | 1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | |||
3 | 1986 | Computing the Visibility Polygon from an Edge | Lee, D. T. ; Lin, A. K. | Computer Vision, Graphics, and Image Processing 34(1), 1-19 | |||
4 | 1986 | Computational Complexity of Art Gallery Problems | Lee, D. T. ; Lin, A. K. | IEEE Transactions on Information Theory 32(2), 276-282 | |||
5 | 1986 | Computing the Largest Empty Rectangle | Chazelle, B.; Drysdale, R. L.; Lee, D. T. | SIAM J. Computing 15, 300-315 | |||
6 | 1986 | Generalized Delaunay Triangulation for Planar Graphs | Lee, D. T. ; Lin, A. K. | Discrete & Computational Geometry 1, 201-217 | |||
7 | 1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 |