A simple on-line bin-packing algorithm. Zbl 0629.68045
Lee, C. C.; Lee, D. T. |
|
1985
|
Two algorithms for constructing a Delaunay triangulation. Zbl 0441.68047
Lee, D. T.; Schachter, B. J. |
|
1980
|
Voronoi diagrams and Delaunay triangulations. Zbl 1295.52001
Aurenhammer, Franz; Klein, Rolf; Lee, Der-Tsai |
|
2013
|
Euclidean shortest paths in the presence of rectilinear barriers. Zbl 0545.90098
Lee, D. T.; Preparata, F. P. |
|
1984
|
Computational complexity of art gallery problems. Zbl 0593.68035
Lee, D. T.; Lin, Arthur K. |
|
1986
|
Efficient algorithms for interval graphs and circular-arc graphs. Zbl 0493.68066
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T. |
|
1982
|
The power of geometric duality. Zbl 0603.68072
Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. |
|
1985
|
On \(k\)-nearest neighbor Voronoi diagrams in the plane. Zbl 0491.68062
Lee, Der-Tsai |
|
1982
|
On-line bin packing in linear time. Zbl 0682.68057
Ramanan, Prakash; Brown, Donna J.; Lee, C. C.; Lee, D. T. |
|
1989
|
Two-dimensional Voronoi diagrams in the \(L_p\)-metric. Zbl 0445.68053
Lee, D. T. |
|
1980
|
Generalized Delaunay triangulation for planar graphs. Zbl 0596.52007
Lee, D. T.; Lin, A. K. |
|
1986
|
Generalization of Voronoi diagrams in the plane. Zbl 0454.68083
Lee, D. T.; Drysdale, R. L. III |
|
1981
|
Visibility of a simple polygon. Zbl 0532.68071
Lee, D. T. |
|
1983
|
An optimal algorithm for finding the kernel of a polygon. Zbl 0403.68051
Lee, D. T.; Preparata, F. P. |
|
1979
|
Medial axis transformation of a planar shape. Zbl 0483.68085
Lee, D. T. |
|
1982
|
Geometric complexity of some location problems. Zbl 0639.68038
Lee, D. T.; Wu, Y. F. |
|
1986
|
Location of a point in a planar subdivision and its applications. Zbl 0357.68034
Lee, D. T.; Preparata, F. P. |
|
1977
|
An optimal solution for the channel-assignment problem. Zbl 0422.68031
Gupta, Udaiprakash I.; Lee, D. T.; Leung, Joseph Y.-T. |
|
1979
|
On the maximum empty rectangle problem. Zbl 0543.68057
Naamad, A.; Lee, D. T.; Hsu, W.-L. |
|
1984
|
Computing the largest empty rectangle. Zbl 0608.68059
Chazelle, B.; Drysdale, R. L.; Lee, D. T. |
|
1986
|
On a circle placement problem. Zbl 0572.65051
Chazelle, B. M.; Lee, D. T. |
|
1986
|
The power of geometric duality revisited. Zbl 0582.68032
Lee, D. T.; Ching, Y. T. |
|
1985
|
Rectilinear shortest paths in the presence of rectangular barriers. Zbl 0655.05041
de Rezende, P. J.; Lee, D. T.; Wu, Y. F. |
|
1989
|
Power domination problem in graphs. Zbl 1128.90577
Liao, Chung-Shou; Lee, Der-Tsai |
|
2005
|
The all-pairs quickest path problem. Zbl 0768.68049
Lee, D. T.; Papadopoulou, E. |
|
1993
|
Voronoi diagrams in \(L_1(L_\infty)\) metrics with 2-dimensional storage applications. Zbl 0447.68111
Lee, D. T.; Wong, C. K. |
|
1980
|
Minimum diameter spanning trees and related problems. Zbl 0749.68042
Ho, Jan-Ming; Lee, D. T.; Chang, Chia-Hsiang; Wong, C. K. |
|
1991
|
On finding the convex hull of a simple polygon. Zbl 0543.52002
Lee, D. T. |
|
1983
|
On the X-Y convex hull of a set of X-Y polygons. Zbl 0523.68061
Nicholl, T. M.; Lee, D. T.; Liao, Y. Z.; Wong, C. K. |
|
1983
|
Rectilinear paths among rectilinear obstacles. Zbl 0865.68010
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1996
|
An \(O(n \log n)\) heuristic for Steiner minimal tree problems on the Euclidean metric. Zbl 0459.68032
MacGregor Smith, J.; Lee, D. T.; Liebman, Judith S. |
|
1981
|
Solving the all-pair shortest path query problem on interval and circular-arc graphs. Zbl 1015.68054
Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. |
|
1998
|
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Zbl 0349.68016
Lee, D. T.; Wong, C. K. |
|
1977
|
On a circle-cover minimization problem. Zbl 0534.68049
Lee, C. C.; Lee, D. T. |
|
1984
|
Two-guard walkability of simple polygons. Zbl 0957.68119
Tseng, L. H.; Heffernan, P.; Lee, D. T. |
|
1998
|
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Zbl 0830.68051
Atallah, M. J.; Chen, D. Z.; Lee, D. T. |
|
1995
|
The all nearest-neighbor problem for convex polygons. Zbl 0387.52001
Lee, D. T.; Preparata, F. P. |
|
1978
|
Computational geometry - a survey. Zbl 0636.68048
Lee, D. T.; Preparata, Franco P. |
|
1987
|
Rectilinear path problems among rectilinear obstacles revisited. Zbl 0831.68110
Yang, Chung-Do; Lee, D. T.; Wong, C. K. |
|
1995
|
An improved algorithm for the rectangle enclosure problem. Zbl 0493.68072
Lee, D. T.; Preparata, F. P. |
|
1982
|
A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains. Zbl 0895.68137
Papadopoulou, E.; Lee, D. T. |
|
1998
|
The \(L_{\infty}\) Voronoi diagram of segments and VLSI applications. Zbl 1074.68648
Papadopoulou, Evanthia; Lee, D. T. |
|
2001
|
Shortest rectilinear paths among weighted obstacles. Zbl 0755.68137
Lee, D. T.; Yang, C. D.; Chen, T. H. |
|
1991
|
Minimum cuts for circular-arc graphs. Zbl 0711.68060
Lee, D. T.; Sarrafzadeh, M.; Wu, Y. F. |
|
1990
|
On bends and lengths of rectilinear paths: A graph-theoretic approach. Zbl 0761.68102
Yang, C. D.; Lee, D. T.; Wong, C. K. |
|
1992
|
Quintary trees: A file structure for multidimensional database systems. Zbl 0441.68122
Lee, D. T.; Wong, C. K. |
|
1980
|
Capacitated domination: problem complexity and approximation algorithms. Zbl 1311.68189
Kao, Mong-Jen; Chen, Han-Lin; Lee, D. T. |
|
2015
|
Ranking and unranking of B-trees. Zbl 0509.68056
Gupta, U. I.; Lee, D. T.; Wong, C. K. |
|
1983
|
Power domination in circular-arc graphs. Zbl 1259.05130
Liao, Chung-Shou; Lee, D. T. |
|
2013
|
The Hausdorff Voronoi diagram of polygonal objects: a divide and conquer approach. Zbl 1101.68914
Papadopoulou, Evanthia; Lee, D. T. |
|
2004
|
Computing the visibility polygon from an edge. Zbl 0625.68050
Lee, D. T.; Lin, A. K. |
|
1986
|
Dynamic Voronoi diagrams. Zbl 0516.94030
Gowda, Ihor G.; Kirkpatrick, David G.; Lee, Der Tsai; Naamad, Amnon |
|
1983
|
Higher-order geodesic Voronoi diagrams in a polygonal domain with holes. Zbl 1422.68251
Liu, Chih-Hung; Lee, D. T. |
|
2013
|
An optimal algorithm for roundness determination on convex polygons. Zbl 0855.68035
Swanson, Kurt; Lee, D. T.; Wu, Vanban L. |
|
1995
|
An optimal algorithm for the maximum two-chain problem. Zbl 0762.68032
Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. |
|
1992
|
1-segment center problems. Zbl 0769.90058
Imai, Hiroshi; Lee, D. T.; Yang, Chung-Do |
|
1992
|
Generating binary trees of bounded height. Zbl 0575.68067
Lee, C. C.; Lee, D. T.; Wong, C. K. |
|
1986
|
Ranking and unranking of 2-3 trees. Zbl 0486.68060
Gupta, Udai; Lee, D. T.; Wong, C. K. |
|
1982
|
Finding an approximate minimum-link visibility path inside a simple polygon. Zbl 1022.68624
Alsuwaiyel, Muhammad H.; Lee, D. T. |
|
1995
|
Point set pattern matching in \(d\)-dimensions. Zbl 0827.68114
de Rezende, P. J.; Lee, D. T. |
|
1995
|
Shortest rectilinear paths among weighted rectangles. Zbl 0764.68185
Yang, C. D.; Chen, T. H.; Lee, D. T. |
|
1990
|
Higher order city Voronoi diagrams. Zbl 1357.68271
Gemsa, Andreas; Lee, D. T.; Liu, Chih-Hung; Wagner, Dorothea |
|
2012
|
On bends and distances of paths among obstacles in two-layer interconnection model. Zbl 1042.68682
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1994
|
The \(k\)-nearest-neighbor Voronoi diagram revisited. Zbl 1315.68255
Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, Der-Tsai |
|
2015
|
Minimal link visibility paths inside a simple polygon. Zbl 0789.68138
Alsuwaiyel, Muhammad H.; Lee, D. T. |
|
1993
|
Parallel batched planar point location on the CCC. Zbl 0689.68063
Lee, D. T.; Preparata, F. P. |
|
1989
|
Parallel geometric algorithms on a mesh-connected computer. Zbl 0684.68042
Jeong, C. S.; Lee, D. T. |
|
1990
|
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram. Zbl 1346.68232
Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, D. T. |
|
2011
|
Capacitated domination problem. Zbl 1213.05194
Kao, Mong-Jen; Liao, Chung-Shou; Lee, D. T. |
|
2011
|
Recursive least squares ladder forms for fast parameter tracking. Zbl 0436.93044
Morf, M.; Lee, D. T. |
|
1979
|
Skew Voronoi diagrams. Zbl 0949.68150
Aichholzer, Oswin; Aurenhammer, Franz; Chen, Danny Z.; Lee, D. T.; Papadopoulou, Evanthia |
|
1999
|
Graph algorithms on a tree-structured parallel computer. Zbl 0545.68061
Yeh, D. Y.; Lee, D. T. |
|
1984
|
An on-chip compare/steer bubble sorter. Zbl 0456.68066
Lee, D. T.; Chang, Hsu; Wong, C. K. |
|
1981
|
Fast algorithms for the density finding problem. Zbl 1172.68060
Lee, D. T.; Lin, Tien-Ching; Lu, Hsueh-I |
|
2009
|
Randomized algorithm for the sum selection problem. Zbl 1173.68855
Lin, Tien-Ching; Lee, D. T. |
|
2005
|
Randomized algorithm for the sum selection problem. Zbl 1115.68170
Lin, Tien-Ching; Lee, D. T. |
|
2007
|
Parallel algorithms for maximum matching in complements of interval graphs and related problems. Zbl 0949.68176
Andrews, M. G.; Atallah, M. J.; Chen, D. Z.; Lee, D. T. |
|
2000
|
Finding rectilinear paths among obstacles in a two-layer interconnection model. Zbl 0887.68078
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1997
|
Two variations of the minimum Steiner problem. Zbl 1066.90105
Hsu, Tsan-Sheng; Tsai, Kuo-Hui; Wang, Da-Wei; Lee, D. T. |
|
2005
|
Computing the largest empty rectangle. Zbl 0554.68044
Chazelle, B.; Drysdale, R. R. III; Lee, D. T. |
|
1984
|
Restricted track assignment with applications. Zbl 0805.68062
Sarrafzadeh, Majid; Lee, D. T. |
|
1994
|
An elementary proof of nonexistence of isometries between \(l^k_p\) and \(l^k_q\). Zbl 0424.68026
Coppersmith, D.; Lee, D. T.; Wong, C. K. |
|
1979
|
Broadcasting in heterogeneous tree networks. Zbl 1286.68013
Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. |
|
2010
|
\(k\) best cuts for circular-arc graphs. Zbl 0868.68089
Tsai, K. H.; Lee, D. T. |
|
1997
|
\((g_0,g_1,\dots,g_k)\)-trees and unary OL systems. Zbl 0495.68056
Lee, D. T.; Liu, C. L.; Wong, C. K. |
|
1983
|
Capacitated domination: constant factor approximations for planar graphs. Zbl 1311.68190
Kao, Mong-Jen; Lee, D. T. |
|
2011
|
On the 2-dimensional channel assignment problem. Zbl 0528.68046
Lee, D. T.; Leung, Joseph Y-T. |
|
1984
|
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem. Zbl 1135.68631
Lin, Tien-Ching; Lee, D. T. |
|
2006
|
\(O(f)\) bi-approximation for capacitated covering with hard capacities. Zbl 1398.05165
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T. |
|
2016
|
An optimal algorithm for the maximum two-chain problem. Zbl 0800.68473
Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. |
|
1990
|
Geometric minimum diameter minimum cost spanning tree problem. Zbl 1272.05207
Seo, Dae Young; Lee, D. T.; Lin, Tien-Ching |
|
2009
|
Computing and combinatorics. 5th annual international conference. COCOON ’99, Tokyo, Japan, July 26–28, 1999. Proceedings. Zbl 0918.00033
|
|
1999
|
The density maximization problem in graphs. Zbl 1282.90215
Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea |
|
2013
|
Record allocation for minimizing seek delay. Zbl 0468.68077
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T.; Pruitt, J. W.; Wong, C. K. |
|
1981
|
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (extended abstract). Zbl 1512.68421
Papadopoulou, Evanthia; Lee, D. T. |
|
1995
|
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities. Zbl 1421.68232
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T. |
|
2019
|
Broadcasting in weighted trees under the postal model. Zbl 1335.68008
Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. |
|
2016
|
The multi-service center problem. Zbl 1380.90166
Yu, Hung-I; Li, Cheng-Chung; Lee, D. T. |
|
2018
|
Online dynamic power management with hard real-time guarantees. Zbl 1328.68036
Chen, Jian-Jia; Kao, Mong-Jen; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea |
|
2015
|
The Steiner minimal tree problem in the \(\lambda \)-geometry plane. Zbl 1503.68281
Lee, D. T.; Shen, C. F. |
|
1996
|
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities. Zbl 1421.68232
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T. |
|
2019
|
The multi-service center problem. Zbl 1380.90166
Yu, Hung-I; Li, Cheng-Chung; Lee, D. T. |
|
2018
|
\(O(f)\) bi-approximation for capacitated covering with hard capacities. Zbl 1398.05165
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T. |
|
2016
|
Broadcasting in weighted trees under the postal model. Zbl 1335.68008
Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. |
|
2016
|
Capacitated domination: problem complexity and approximation algorithms. Zbl 1311.68189
Kao, Mong-Jen; Chen, Han-Lin; Lee, D. T. |
|
2015
|
The \(k\)-nearest-neighbor Voronoi diagram revisited. Zbl 1315.68255
Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, Der-Tsai |
|
2015
|
Online dynamic power management with hard real-time guarantees. Zbl 1328.68036
Chen, Jian-Jia; Kao, Mong-Jen; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea |
|
2015
|
Voronoi diagrams and Delaunay triangulations. Zbl 1295.52001
Aurenhammer, Franz; Klein, Rolf; Lee, Der-Tsai |
|
2013
|
Power domination in circular-arc graphs. Zbl 1259.05130
Liao, Chung-Shou; Lee, D. T. |
|
2013
|
Higher-order geodesic Voronoi diagrams in a polygonal domain with holes. Zbl 1422.68251
Liu, Chih-Hung; Lee, D. T. |
|
2013
|
The density maximization problem in graphs. Zbl 1282.90215
Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea |
|
2013
|
Optimal time-convex hull under the \(L _{p }\) metrics. Zbl 1391.68107
Dai, Bang-Sin; Kao, Mong-Jen; Lee, D. T. |
|
2013
|
Higher order city Voronoi diagrams. Zbl 1357.68271
Gemsa, Andreas; Lee, D. T.; Liu, Chih-Hung; Wagner, Dorothea |
|
2012
|
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram. Zbl 1346.68232
Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, D. T. |
|
2011
|
Capacitated domination problem. Zbl 1213.05194
Kao, Mong-Jen; Liao, Chung-Shou; Lee, D. T. |
|
2011
|
Capacitated domination: constant factor approximations for planar graphs. Zbl 1311.68190
Kao, Mong-Jen; Lee, D. T. |
|
2011
|
Broadcasting in heterogeneous tree networks. Zbl 1286.68013
Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. |
|
2010
|
Fast algorithms for the density finding problem. Zbl 1172.68060
Lee, D. T.; Lin, Tien-Ching; Lu, Hsueh-I |
|
2009
|
Geometric minimum diameter minimum cost spanning tree problem. Zbl 1272.05207
Seo, Dae Young; Lee, D. T.; Lin, Tien-Ching |
|
2009
|
Randomized algorithm for the sum selection problem. Zbl 1115.68170
Lin, Tien-Ching; Lee, D. T. |
|
2007
|
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem. Zbl 1135.68631
Lin, Tien-Ching; Lee, D. T. |
|
2006
|
Power domination problem in graphs. Zbl 1128.90577
Liao, Chung-Shou; Lee, Der-Tsai |
|
2005
|
Randomized algorithm for the sum selection problem. Zbl 1173.68855
Lin, Tien-Ching; Lee, D. T. |
|
2005
|
Two variations of the minimum Steiner problem. Zbl 1066.90105
Hsu, Tsan-Sheng; Tsai, Kuo-Hui; Wang, Da-Wei; Lee, D. T. |
|
2005
|
The Hausdorff Voronoi diagram of polygonal objects: a divide and conquer approach. Zbl 1101.68914
Papadopoulou, Evanthia; Lee, D. T. |
|
2004
|
The \(L_{\infty}\) Voronoi diagram of segments and VLSI applications. Zbl 1074.68648
Papadopoulou, Evanthia; Lee, D. T. |
|
2001
|
Parallel algorithms for maximum matching in complements of interval graphs and related problems. Zbl 0949.68176
Andrews, M. G.; Atallah, M. J.; Chen, D. Z.; Lee, D. T. |
|
2000
|
Skew Voronoi diagrams. Zbl 0949.68150
Aichholzer, Oswin; Aurenhammer, Franz; Chen, Danny Z.; Lee, D. T.; Papadopoulou, Evanthia |
|
1999
|
Computing and combinatorics. 5th annual international conference. COCOON ’99, Tokyo, Japan, July 26–28, 1999. Proceedings. Zbl 0918.00033
|
|
1999
|
Solving the all-pair shortest path query problem on interval and circular-arc graphs. Zbl 1015.68054
Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. |
|
1998
|
Two-guard walkability of simple polygons. Zbl 0957.68119
Tseng, L. H.; Heffernan, P.; Lee, D. T. |
|
1998
|
A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains. Zbl 0895.68137
Papadopoulou, E.; Lee, D. T. |
|
1998
|
Finding rectilinear paths among obstacles in a two-layer interconnection model. Zbl 0887.68078
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1997
|
\(k\) best cuts for circular-arc graphs. Zbl 0868.68089
Tsai, K. H.; Lee, D. T. |
|
1997
|
Rectilinear paths among rectilinear obstacles. Zbl 0865.68010
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1996
|
The Steiner minimal tree problem in the \(\lambda \)-geometry plane. Zbl 1503.68281
Lee, D. T.; Shen, C. F. |
|
1996
|
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Zbl 0830.68051
Atallah, M. J.; Chen, D. Z.; Lee, D. T. |
|
1995
|
Rectilinear path problems among rectilinear obstacles revisited. Zbl 0831.68110
Yang, Chung-Do; Lee, D. T.; Wong, C. K. |
|
1995
|
An optimal algorithm for roundness determination on convex polygons. Zbl 0855.68035
Swanson, Kurt; Lee, D. T.; Wu, Vanban L. |
|
1995
|
Finding an approximate minimum-link visibility path inside a simple polygon. Zbl 1022.68624
Alsuwaiyel, Muhammad H.; Lee, D. T. |
|
1995
|
Point set pattern matching in \(d\)-dimensions. Zbl 0827.68114
de Rezende, P. J.; Lee, D. T. |
|
1995
|
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (extended abstract). Zbl 1512.68421
Papadopoulou, Evanthia; Lee, D. T. |
|
1995
|
On bends and distances of paths among obstacles in two-layer interconnection model. Zbl 1042.68682
Lee, D. T.; Yang, C. D.; Wong, C. K. |
|
1994
|
Restricted track assignment with applications. Zbl 0805.68062
Sarrafzadeh, Majid; Lee, D. T. |
|
1994
|
The all-pairs quickest path problem. Zbl 0768.68049
Lee, D. T.; Papadopoulou, E. |
|
1993
|
Minimal link visibility paths inside a simple polygon. Zbl 0789.68138
Alsuwaiyel, Muhammad H.; Lee, D. T. |
|
1993
|
On bends and lengths of rectilinear paths: A graph-theoretic approach. Zbl 0761.68102
Yang, C. D.; Lee, D. T.; Wong, C. K. |
|
1992
|
An optimal algorithm for the maximum two-chain problem. Zbl 0762.68032
Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. |
|
1992
|
1-segment center problems. Zbl 0769.90058
Imai, Hiroshi; Lee, D. T.; Yang, Chung-Do |
|
1992
|
Minimum diameter spanning trees and related problems. Zbl 0749.68042
Ho, Jan-Ming; Lee, D. T.; Chang, Chia-Hsiang; Wong, C. K. |
|
1991
|
Shortest rectilinear paths among weighted obstacles. Zbl 0755.68137
Lee, D. T.; Yang, C. D.; Chen, T. H. |
|
1991
|
Minimum cuts for circular-arc graphs. Zbl 0711.68060
Lee, D. T.; Sarrafzadeh, M.; Wu, Y. F. |
|
1990
|
Shortest rectilinear paths among weighted rectangles. Zbl 0764.68185
Yang, C. D.; Chen, T. H.; Lee, D. T. |
|
1990
|
Parallel geometric algorithms on a mesh-connected computer. Zbl 0684.68042
Jeong, C. S.; Lee, D. T. |
|
1990
|
An optimal algorithm for the maximum two-chain problem. Zbl 0800.68473
Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. |
|
1990
|
On-line bin packing in linear time. Zbl 0682.68057
Ramanan, Prakash; Brown, Donna J.; Lee, C. C.; Lee, D. T. |
|
1989
|
Rectilinear shortest paths in the presence of rectangular barriers. Zbl 0655.05041
de Rezende, P. J.; Lee, D. T.; Wu, Y. F. |
|
1989
|
Parallel batched planar point location on the CCC. Zbl 0689.68063
Lee, D. T.; Preparata, F. P. |
|
1989
|
Computational geometry - a survey. Zbl 0636.68048
Lee, D. T.; Preparata, Franco P. |
|
1987
|
Computational complexity of art gallery problems. Zbl 0593.68035
Lee, D. T.; Lin, Arthur K. |
|
1986
|
Generalized Delaunay triangulation for planar graphs. Zbl 0596.52007
Lee, D. T.; Lin, A. K. |
|
1986
|
Geometric complexity of some location problems. Zbl 0639.68038
Lee, D. T.; Wu, Y. F. |
|
1986
|
Computing the largest empty rectangle. Zbl 0608.68059
Chazelle, B.; Drysdale, R. L.; Lee, D. T. |
|
1986
|
On a circle placement problem. Zbl 0572.65051
Chazelle, B. M.; Lee, D. T. |
|
1986
|
Computing the visibility polygon from an edge. Zbl 0625.68050
Lee, D. T.; Lin, A. K. |
|
1986
|
Generating binary trees of bounded height. Zbl 0575.68067
Lee, C. C.; Lee, D. T.; Wong, C. K. |
|
1986
|
A simple on-line bin-packing algorithm. Zbl 0629.68045
Lee, C. C.; Lee, D. T. |
|
1985
|
The power of geometric duality. Zbl 0603.68072
Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. |
|
1985
|
The power of geometric duality revisited. Zbl 0582.68032
Lee, D. T.; Ching, Y. T. |
|
1985
|
Euclidean shortest paths in the presence of rectilinear barriers. Zbl 0545.90098
Lee, D. T.; Preparata, F. P. |
|
1984
|
On the maximum empty rectangle problem. Zbl 0543.68057
Naamad, A.; Lee, D. T.; Hsu, W.-L. |
|
1984
|
On a circle-cover minimization problem. Zbl 0534.68049
Lee, C. C.; Lee, D. T. |
|
1984
|
Graph algorithms on a tree-structured parallel computer. Zbl 0545.68061
Yeh, D. Y.; Lee, D. T. |
|
1984
|
Computing the largest empty rectangle. Zbl 0554.68044
Chazelle, B.; Drysdale, R. R. III; Lee, D. T. |
|
1984
|
On the 2-dimensional channel assignment problem. Zbl 0528.68046
Lee, D. T.; Leung, Joseph Y-T. |
|
1984
|
Visibility of a simple polygon. Zbl 0532.68071
Lee, D. T. |
|
1983
|
On finding the convex hull of a simple polygon. Zbl 0543.52002
Lee, D. T. |
|
1983
|
On the X-Y convex hull of a set of X-Y polygons. Zbl 0523.68061
Nicholl, T. M.; Lee, D. T.; Liao, Y. Z.; Wong, C. K. |
|
1983
|
Ranking and unranking of B-trees. Zbl 0509.68056
Gupta, U. I.; Lee, D. T.; Wong, C. K. |
|
1983
|
Dynamic Voronoi diagrams. Zbl 0516.94030
Gowda, Ihor G.; Kirkpatrick, David G.; Lee, Der Tsai; Naamad, Amnon |
|
1983
|
\((g_0,g_1,\dots,g_k)\)-trees and unary OL systems. Zbl 0495.68056
Lee, D. T.; Liu, C. L.; Wong, C. K. |
|
1983
|
Efficient algorithms for interval graphs and circular-arc graphs. Zbl 0493.68066
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T. |
|
1982
|
On \(k\)-nearest neighbor Voronoi diagrams in the plane. Zbl 0491.68062
Lee, Der-Tsai |
|
1982
|
Medial axis transformation of a planar shape. Zbl 0483.68085
Lee, D. T. |
|
1982
|
An improved algorithm for the rectangle enclosure problem. Zbl 0493.68072
Lee, D. T.; Preparata, F. P. |
|
1982
|
Ranking and unranking of 2-3 trees. Zbl 0486.68060
Gupta, Udai; Lee, D. T.; Wong, C. K. |
|
1982
|
Generalization of Voronoi diagrams in the plane. Zbl 0454.68083
Lee, D. T.; Drysdale, R. L. III |
|
1981
|
An \(O(n \log n)\) heuristic for Steiner minimal tree problems on the Euclidean metric. Zbl 0459.68032
MacGregor Smith, J.; Lee, D. T.; Liebman, Judith S. |
|
1981
|
An on-chip compare/steer bubble sorter. Zbl 0456.68066
Lee, D. T.; Chang, Hsu; Wong, C. K. |
|
1981
|
Record allocation for minimizing seek delay. Zbl 0468.68077
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T.; Pruitt, J. W.; Wong, C. K. |
|
1981
|
Two algorithms for constructing a Delaunay triangulation. Zbl 0441.68047
Lee, D. T.; Schachter, B. J. |
|
1980
|
Two-dimensional Voronoi diagrams in the \(L_p\)-metric. Zbl 0445.68053
Lee, D. T. |
|
1980
|
Voronoi diagrams in \(L_1(L_\infty)\) metrics with 2-dimensional storage applications. Zbl 0447.68111
Lee, D. T.; Wong, C. K. |
|
1980
|
Quintary trees: A file structure for multidimensional database systems. Zbl 0441.68122
Lee, D. T.; Wong, C. K. |
|
1980
|
An optimal algorithm for finding the kernel of a polygon. Zbl 0403.68051
Lee, D. T.; Preparata, F. P. |
|
1979
|
An optimal solution for the channel-assignment problem. Zbl 0422.68031
Gupta, Udaiprakash I.; Lee, D. T.; Leung, Joseph Y.-T. |
|
1979
|
Recursive least squares ladder forms for fast parameter tracking. Zbl 0436.93044
Morf, M.; Lee, D. T. |
|
1979
|
An elementary proof of nonexistence of isometries between \(l^k_p\) and \(l^k_q\). Zbl 0424.68026
Coppersmith, D.; Lee, D. T.; Wong, C. K. |
|
1979
|
The all nearest-neighbor problem for convex polygons. Zbl 0387.52001
Lee, D. T.; Preparata, F. P. |
|
1978
|
Location of a point in a planar subdivision and its applications. Zbl 0357.68034
Lee, D. T.; Preparata, F. P. |
|
1977
|
...and 1 more Documents |