2023 - Research.com Mathematics in Taiwan Leader Award
2022 - Research.com Mathematics in Taiwan Leader Award
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.
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
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.
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.
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.
Two algorithms for constructing a Delaunay triangulation
D. T. Lee;Bruce J. Schachter.
International Journal of Parallel Programming (1980)
Travel-time prediction with support vector regression
Chun-Hsin Wu;Jan-Ming Ho;D.T. Lee.
IEEE Transactions on Intelligent Transportation Systems (2004)
Securing web application code by static analysis and runtime protection
Yao-Wen Huang;Fang Yu;Christian Hang;Chung-Hung Tsai.
the web conference (2004)
Medial Axis Transformation of a Planar Shape
D. T. Lee.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1982)
Computational complexity of art gallery problems
D. T. Lee;A. K. Lin.
Autonomous robot vehicles (1990)
Euclidean shortest paths in the presence of rectilinear barriers
Der-Tsai Lee;Franco P. Preparata.
A simple on-line bin-packing algorithm
C. C. Lee;D. T. Lee.
Journal of the ACM (1985)
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers (1982)
Generalization of Voronoi Diagrams in the Plane
D. T. Lee;Robert L. (Scot) Drysdale.
SIAM Journal on Computing (1981)
The power of geometric duality
Bernard Chazelle;Leo J. Guibas;D. T. Lee.
Bit Numerical Mathematics (1985)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: