D. T. Lee

4.7k total citations · 1 hit paper
42 papers, 3.1k citations indexed

About

D. T. Lee is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computational Theory and Mathematics. According to data from OpenAlex, D. T. Lee has authored 42 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computer Graphics and Computer-Aided Design, 15 papers in Computer Vision and Pattern Recognition and 11 papers in Computational Theory and Mathematics. Recurrent topics in D. T. Lee's work include Computational Geometry and Mesh Generation (31 papers), Optimization and Packing Problems (9 papers) and Digital Image Processing Techniques (8 papers). D. T. Lee is often cited by papers focused on Computational Geometry and Mesh Generation (31 papers), Optimization and Packing Problems (9 papers) and Digital Image Processing Techniques (8 papers). D. T. Lee collaborates with scholars based in United States, Taiwan and Hong Kong. D. T. Lee's co-authors include Bruce J. Schachter, A. Lin, C. K. Wong, F. P. Preparata, Y. F. Wu, Joseph Y.‐T. Leung, Wen−Lian Hsu, J. MacGregor Smith, Judith S. Liebman and Bernard Chazelle and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Journal of the ACM and IBM Journal of Research and Development.

In The Last Decade

D. T. Lee

42 papers receiving 2.9k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Two algorithms for constructing a Delaunay triangulation

1980 1.1k citations D. T. Lee et al. profile →

Peers

Countries citing papers authored by D. T. Lee

Since Specialization

Citations

This map shows the geographic impact of D. T. Lee's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by D. T. Lee with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. T. Lee more than expected).

Fields of papers citing papers by D. T. Lee

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. T. Lee. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by D. T. Lee. The network helps show where D. T. Lee may publish in the future.

Co-authorship network of co-authors of D. T. Lee

This figure shows the co-authorship network connecting the top 25 collaborators of D. T. Lee. A scholar is included among the top collaborators of D. T. Lee based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. T. Lee. D. T. Lee is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion 2000 ·Algorithmica ·(unknown), D. T. Lee	3
2	Two-Guard Walkability of Simple Polygons 1998 ·International Journal of Computational Geometry & Applications ·(unknown), Paul J. Heffernan, D. T. Lee	26
3	Solving the all-pair shortest path query problem on interval and circular-arc graphs 1998 ·Networks ·Danny Z. Chen, D. T. Lee, R. Sridhar, (unknown)	25
4	Rectilinear paths among rectilinear obstacles 1996 ·Discrete Applied Mathematics ·D. T. Lee, (unknown), C. K. Wong	39
5	An optimal algorithm for roundness determination on convex polygons 1995 ·Computational Geometry ·(unknown), D. T. Lee, (unknown)	20
6	Parallel algorithms on circular-arc graphs 1995 ·Computational Geometry ·(unknown), D. T. Lee	2
7	An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications 1995 ·Algorithmica ·Mikhail J. Atallah, (unknown), D. T. Lee	15
8	Minimal link visibility paths inside a simple polygon 1993 ·Computational Geometry ·(unknown), D. T. Lee	12
9	1-Segment Center Problems 1992 ·INFORMS Journal on Computing ·Hiroshi Imai, D. T. Lee, (unknown)	10
10	SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE 1991 ·International Journal of Computational Geometry & Applications ·D. T. Lee, (unknown), (unknown)	15
11	An optimal algorithm for the maximum two-chain problem 1990 ·Symposium on Discrete Algorithms ·(unknown), Majid Sarrafzadeh, D. T. Lee	10
12	Parallel batched planar point location on the CCC 1989 ·Information Processing Letters ·D. T. Lee, F. P. Preparata	3
13	Generating binary trees of bounded height 1986 ·Acta Informatica ·(unknown), D. T. Lee, C. K. Wong	13
14	On the maximum empty rectangle problem 1984 ·Discrete Applied Mathematics ·(unknown), D. T. Lee, Wen−Lian Hsu	63
15	The power of geometric duality 1983 ·Bernard Chazelle, Leo J. Guibas, D. T. Lee	49
16	Ranking and unranking of B-trees 1983 ·Journal of Algorithms ·(unknown), D. T. Lee, C. K. Wong	10
17	Shading of regions on vector display devises 1981 ·D. T. Lee	11
18	Two-Dimensional Voronoi Diagrams in the L _p -Metric 1980 ·Journal of the ACM ·D. T. Lee	148
19	A note on the all nearest-neighbor problem for convex polygons 1979 ·Information Processing Letters ·Chao‐Chin Yang, D. T. Lee	11
20	Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees 1977 ·Acta Informatica ·D. T. Lee, C. K. Wong	138

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact