H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 55 Citations 16,230 207 World Ranking 2172 National Ranking 13
Mathematics D-index 49 Citations 12,060 151 World Ranking 591 National Ranking 3

Research.com Recognitions

Awards & Achievements

2008 - Fellow, The World Academy of Sciences

1997 - ACM Fellow For contribution to Computational Geometry and Design and Analysis of Algorithms.

1992 - IEEE Fellow For contributions to computational geometry and design and analysis of algorithms.

Overview

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Algorithm
  • Operating system

Der-Tsai Lee mainly focuses on Combinatorics, Voronoi diagram, Discrete mathematics, Simple polygon and Time complexity. His work is dedicated to discovering how Combinatorics, Polygon are connected with Point location and other disciplines. As a part of the same scientific study, Der-Tsai Lee usually deals with the Voronoi diagram, concentrating on Computation and frequently concerns with Range query, Quadratic equation, Preprocessor and Mobile robot.

He focuses mostly in the field of Simple polygon, narrowing it down to matters related to Medial axis and, in some cases, Two-dimensional space and Roundness. His Time complexity study also includes fields such as

  • Simple most often made with reference to Line,
  • Upper and lower bounds which is related to area like Linearity. His Bowyer–Watson algorithm research includes elements of Pitteway triangulation and Constrained Delaunay triangulation.

His most cited work include:

  • Two algorithms for constructing a Delaunay triangulation (1049 citations)
  • Travel-time prediction with support vector regression (727 citations)
  • Securing web application code by static analysis and runtime protection (542 citations)

What are the main themes of his work throughout his whole career to date?

His main research concerns Combinatorics, Discrete mathematics, Time complexity, Algorithm and Voronoi diagram. His Combinatorics research is multidisciplinary, incorporating perspectives in Upper and lower bounds and Simple polygon. His Discrete mathematics study frequently links to adjacent areas such as Metric.

His study looks at the intersection of Time complexity and topics like Computational geometry with Analysis of algorithms. His research on Algorithm frequently connects to adjacent areas such as Routing. Many of his research projects under Voronoi diagram are closely connected to Critical area with Critical area, tying the diverse disciplines of science together.

He most often published in these fields:

  • Combinatorics (48.55%)
  • Discrete mathematics (19.61%)
  • Time complexity (14.15%)

What were the highlights of his more recent work (between 2012-2021)?

  • Combinatorics (48.55%)
  • Discrete mathematics (19.61%)
  • Vertex (5.79%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Combinatorics, Discrete mathematics, Vertex, Algorithm and Vertex cover. His research in Combinatorics intersects with topics in Metric, Convex hull, Voronoi diagram, Range and Plane. His Voronoi diagram research includes themes of Efficient algorithm, Diagram and Mobile robot.

His research integrates issues of Approximation algorithm and Parameterized complexity in his study of Discrete mathematics. His Vertex research incorporates themes from Broadcasting and Broadcast time. In general Algorithm, his work in Computation is often linked to DNA sequencing, Biochip and Microfluidics linking many areas of study.

Between 2012 and 2021, his most popular works were:

  • Voronoi Diagrams and Delaunay Triangulations (183 citations)
  • Discovering joint audio---visual codewords for video event detection (37 citations)
  • An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips (30 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Algorithm
  • Operating system

Der-Tsai Lee spends much of his time researching Combinatorics, Algorithm, Voronoi diagram, Discrete mathematics and Pattern recognition. His studies in Dominating set, Parameterized complexity, Treewidth, Approximation algorithm and 1-planar graph are all subfields of Combinatorics research. His Algorithm study combines topics in areas such as Routing and Steiner tree problem.

His studies deal with areas such as Delaunay triangulation, Theoretical computer science and Diagram as well as Voronoi diagram. The concepts of his Diagram study are interwoven with issues in Simple polygon, Bowyer–Watson algorithm, Geodesic, Plane and Order. His work carried out in the field of Pattern recognition brings together such families of science as Bipartite graph and Artificial intelligence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Two algorithms for constructing a Delaunay triangulation

D. T. Lee;Bruce J. Schachter.
International Journal of Parallel Programming (1980)

1909 Citations

Travel-time prediction with support vector regression

Chun-Hsin Wu;Jan-Ming Ho;D.T. Lee.
IEEE Transactions on Intelligent Transportation Systems (2004)

1216 Citations

Securing web application code by static analysis and runtime protection

Yao-Wen Huang;Fang Yu;Christian Hang;Chung-Hung Tsai.
the web conference (2004)

845 Citations

Medial Axis Transformation of a Planar Shape

D. T. Lee.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1982)

709 Citations

Computational complexity of art gallery problems

D. T. Lee;A. K. Lin.
IEEE Transactions on Information Theory (1986)

510 Citations

Euclidean shortest paths in the presence of rectilinear barriers

Der-Tsai Lee;Franco P. Preparata.
Networks (1984)

481 Citations

A simple on-line bin-packing algorithm

C. C. Lee;D. T. Lee.
Journal of the ACM (1985)

431 Citations

On k-Nearest Neighbor Voronoi Diagrams in the Plane

Der-Tsai Lee.
IEEE Transactions on Computers (1982)

430 Citations

Generalization of Voronoi Diagrams in the Plane

D. T. Lee;Robert L. (Scot) Drysdale.
SIAM Journal on Computing (1981)

421 Citations

The power of geometric duality

Bernard Chazelle;Leo J. Guibas;D. T. Lee.
Bit Numerical Mathematics (1985)

416 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Der-Tsai Lee

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 64

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 53

Godfried T. Toussaint

Godfried T. Toussaint

New York University Abu Dhabi

Publications: 51

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 51

Leah Epstein

Leah Epstein

University of Haifa

Publications: 50

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 48

Herbert Edelsbrunner

Herbert Edelsbrunner

Institute of Science and Technology Austria

Publications: 46

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 44

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 38

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 36

Steven Teig

Steven Teig

Cadence Design Systems (United States)

Publications: 35

Franz Aurenhammer

Franz Aurenhammer

Graz University of Technology

Publications: 33

Franco P. Preparata

Franco P. Preparata

Brown University

Publications: 31

Majid Sarrafzadeh

Majid Sarrafzadeh

University of California, Los Angeles

Publications: 30

Roberto Tamassia

Roberto Tamassia

Brown University

Publications: 28

David Eppstein

David Eppstein

University of California, Irvine

Publications: 27

Something went wrong. Please try again later.