D. T. Lee
Impact in
-
- Computational Geometry and Mesh Generation
- Computer Graphics and Visualization Techniques
- Signal Processing top 1%
- Data Management and Algorithms
Papers in
-
- Computational Geometry and Mesh Generation 31
-
- Digital Image Processing Techniques 8
- Robotic Path Planning Algorithms 5
- Co-authors
- Bruce J. Schachter (1 shared paper)A. Lin (1 shared paper)C. K. Wong (4 shared papers)F. P. Preparata (4 shared papers)Y. F. Wu (2 shared papers)Joseph Y.‐T. Leung (1 shared paper)Wen−Lian Hsu (1 shared paper)J. MacGregor Smith (1 shared paper)
- Journals
- Algorithmica (5 papers)Journal of the ACM (3 papers)Networks (3 papers)Computational Geometry (3 papers)Discrete & Computational Geometry (2 papers)
- Partner nations
- United StatesHong KongTaiwan
In The Last Decade
D. T. Lee
42 papers receiving 2.9k citations
D. T. Lee's Hit Papers
Peers
Comparison fields: 5 of 155
- Computer Graphics and Computer-Aided Design 1.3k
- Signal Processing 495
- Computer Vision and Pattern Recognition 889
- Industrial and Manufacturing Engineering 410
- Computational Theory and Mathematics 353
Countries citing papers authored by D. T. Lee
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
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-authors
The 25 scholars most cited alongside D. T. Lee, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 42 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Two algorithms for constructing a Delaunay triangulation Hit paper breakdown → | 1980 | 1105 |
| 2 | 1982 | 348 | |
| 3 | 1985 | 204 | |
| 4 | 1986 | 191 | |
| 5 | 1982 | 159 | |
| 6 | 1980 | 149 | |
| 7 | 1977 | 138 | |
| 8 | 1979 | 100 | |
| 9 | 1986 | 81 | |
| 10 | 1984 | 63 | |
| 11 | 1981 | 55 | |
| 12 | 1989 | 49 | |
| 13 | 1983 | 49 | |
| 14 | 1996 | 39 | |
| 15 | 1983 | 33 | |
| 16 | 1978 | 28 | |
| 17 | 1998 | 26 | |
| 18 | 1998 | 26 | |
| 19 | 1982 | 25 | |
| 20 | 1990 | 25 |
About D. T. Lee
D. T. Lee is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Signal Processing, having authored 42 papers that have together received 3.1k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (31 papers), Optimization and Packing Problems (9 papers), Digital Image Processing Techniques (8 papers), Data Management and Algorithms (8 papers), Advanced Graph Theory Research (7 papers), VLSI and FPGA Design Techniques (6 papers), Complexity and Algorithms in Graphs (6 papers) and Robotic Path Planning Algorithms (5 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (1.3k citations), Signal Processing (495 citations), Computer Vision and Pattern Recognition (889 citations), Industrial and Manufacturing Engineering (410 citations) and Computational Theory and Mathematics (353 citations). D. T. Lee has collaborated with scholars based in United States, Hong Kong and Taiwan. Frequent 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 Pedro J. de Rezende. Their work appears in journals such as Algorithmica, Journal of the ACM, Networks, Computational Geometry and Discrete & Computational Geometry.
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.