Der-Tsai Lee | Academic Influence

Der-Tsai Lee's AcademicInfluence.com Rankings

Der-Tsai Lee

Computer Science

#3455

World Rank

#3627

Historical Rank

Machine Learning

#1795

World Rank

#1818

Historical Rank

Artificial Intelligence

#1958

World Rank

#1992

Historical Rank

Database

#3108

World Rank

#3239

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Der-Tsai Lee's Degrees

PhD Electrical Engineering Stanford University
Masters Electrical Engineering Stanford University
Bachelors Electrical Engineering National Taiwan University

Why Is Der-Tsai Lee Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Der-Tsai Lee is a Taiwanese computer scientist, known for his work in computational geometry. For many years he was a professor at Northwestern University. He has been a distinguished research fellow of the Institute for Information Science at the Academia Sinica in Taipei, Taiwan since 1998. From 1998 to 2008, he was director of this institute. He was the 14th President of National Chung Hsing University from August 1, 2011.

(See a Problem?)

Der-Tsai Lee's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Two algorithms for constructing a Delaunay triangulation (1980) (1228)
Medial Axis Transformation of a Planar Shape (1982) (508)
Computational complexity of art gallery problems (1986) (431)
Euclidean shortest paths in the presence of rectilinear barriers (1984) (405)
A simple on-line bin-packing algorithm (1985) (379)
The power of geometric duality (1983) (337)
Generalization of Voronoi Diagrams in the Plane (1981) (321)
On k-Nearest Neighbor Voronoi Diagrams in the Plane (1982) (289)
Generalized delaunay triangulation for planar graphs (1986) (282)
Efficient algorithms for interval graphs and circular-arc graphs (1982) (264)
Computational Geometry—A Survey (1984) (256)
Location of a point in a planar subdivision and its applications (1976) (253)
Two-Dimensional Voronoi Diagrams in the Lp-Metric (1980) (230)
Visibility of a simple polygon (1983) (199)
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees (1977) (189)
An Optimal Solution for the Channel-Assignment Problem (1979) (168)
An Optimal Algorithm for Finding the Kernel of a Polygon (1979) (160)
Computing the Largest Empty Rectangle (1984) (146)
On-Line Bin Packing in Linear Time (1989) (136)
On the maximum empty rectangle problem (1984) (123)
Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications (1980) (121)
Skeletonization via Distance Maps and Level Sets (1995) (120)
The All-Pairs Quickest Path Problem (1993) (97)
Rectilinear Paths Among Rectilinear Obstacles (1992) (94)
An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric (1981) (89)
A new approach to topological via minimization (1989) (82)
Quintary trees: a file structure for multidimensional datbase sytems (1980) (81)
Dynamic Voronoi diagrams (1983) (79)
Rectilinear shortest paths in the presence of rectangular barriers (1989) (79)
Geometric complexity of some location problems (1986) (74)
Rectilinear shortest paths with rectangular barriers (1985) (74)
On a circle placement problem (1986) (71)
The Power of Geometric Duality Revisited (1985) (70)
An efficient new algorithm for 2-D line clipping: Its development and analysis (1987) (70)
Power Domination Problem in Graphs (2005) (70)
Two-Guard Walkability of Simple Polygons (1998) (62)
Critical area computation via Voronoi diagrams (1999) (59)
On the X-Y convex hull of a set of X-Y polygons (1983) (51)
An On-Chip Compare/Steer Bubble Sorter (1981) (50)
Shortest rectilinear paths among weighted obstacles (1990) (49)
Computing the visibility polygon from an edge (1986) (46)
On a Circle-Cover Minimization Problem (1984) (43)
An efficient bi-criteria flow channel routing algorithm for flow-based microfluidic biochips (2014) (42)
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains (1998) (42)
An Optimal Algorithm for Roundness Determination on Convex Polygons (1993) (42)
An optimal algorithm for the maximum two-chain problem (1992) (40)
Rectilinear Path Problems among Rectilinear Obstacles Revisited (1995) (39)
An Improved Algorithm for the Rectangle Enclosure Problem (1982) (37)
Solving the all-pair shortest path query problem on interval and circular-arc graphs (1998) (37)
The All Nearest-Neighbor Problem for Convex Polygons (1978) (36)
Multi-party k-Means Clustering with Privacy Consideration (2010) (35)
On finding the convex hull of a simple polygon (1983) (33)
Voronoi diagrams for direction-sensitive distances (1997) (32)
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach (2004) (32)
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach (1991) (31)
Minimal Link Visibility Paths Inside a Simple Polygon (1993) (31)
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm (2012) (29)
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model (1994) (27)
The Linfty-Voronoi Diagram of Segments and VLSI Applications (2001) (27)
Point Set pattern matching ind-dimensions (2005) (26)
On Steiner tree problem with 45/spl deg/ routing (1995) (26)
Skew Voronoi Diagrams (1999) (26)
Power Domination in Circular-Arc Graphs (2013) (26)
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (1993) (25)
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon (1995) (24)
Relative neighborhood graphs in the Li-metric (1985) (23)
Randomized algorithm for the sum selection problem (2005) (23)
Finding Intersection of Rectangles by Range Search (1981) (23)
Capacitated Domination Problem (2007) (22)
On crossing minimization problem (1998) (21)
Minimum Cuts for Circular-Arc Graphs (1990) (21)
Finding the diameter of a set of lines (1985) (20)
Ranking and Unranking of B-Trees (1983) (20)
Capacitated Domination: Problem Complexity and Approximation Algorithms (2015) (18)
An Optimal Illumination Region Algorithm for Convex Polygons (1982) (18)
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane (1996) (18)
Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction (2014) (17)
Planar subset of multi-terminal nets (1990) (17)
Geosheet: A Distributed Visualization Tool for Geometric Algorithms (1998) (17)
1-Segment Center Problems (1992) (16)
On bends and lengths of rectilinear paths: a graph theoretic approach (1992) (16)
On the 2-Dimensional Channel Assignment Problem (1984) (15)
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram (2011) (15)
Location of Multiple Points in a Planar Subdivision (1979) (14)
A Note on the all Nearest-Neighbor Problem for Convex Polygons (1979) (14)
Shading of regions on vector display devises (1981) (14)
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems (2000) (12)
Ranking and Unranking of 2-3 Trees (1982) (12)
The k-Nearest-Neighbor Voronoi Diagram Revisited (2015) (11)
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes (2013) (11)
Online dynamic power management with hard real-time guarantees (2015) (11)
On Steiner Tree Problem with 45 Degree Routing. (1995) (10)
A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts (1996) (10)
Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model (1997) (10)
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon (1997) (9)
Parallel Batched Planar Point Location on the CCC (1989) (9)
Topological Via Minimization Revisited (1991) (9)
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract) (1995) (9)
Parallel geometric algorithms on a mesh-connected computer (1987) (9)
Parallel Algorithms on Circular-arc Graphs (1995) (9)
Restricted track assignment with applications (1994) (8)
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (2012) (8)
Higher Order City Voronoi Diagrams (2012) (8)
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing (2002) (7)
Fast Algorithms for the Density Finding Problem (2009) (7)
Efficient algorithms for the sum selection problem and k maximum sums problem (2006) (7)
Critical area computation—a new approach (1998) (7)
Geometric Location Problems and Their Complexity (1986) (6)
Solving the all-pair shortest path problem on interval and circular-arc graphs (1994) (6)
On the complexity of bicriteria spanning tree problems for a set of points in the plane (1999) (6)
Interval, Segment, Range, and Priority Search Trees (2004) (6)
Maximum independent set of a permutation graph in K tracks (1991) (5)
Labeling Points on a Single Line (2005) (5)
Broadcasting in Heterogeneous Tree Networks (2010) (5)
k best cuts for circular-arc graphs (1997) (5)
Steiner Problems on Directed Acyclic Graphs (1996) (5)
Generating binary trees of bounded height (1986) (5)
Parallel algorithms for maximum matching in interval graphs (1995) (4)
Time Convex Hull with a Highway (2007) (4)
Capacitated Domination: Constant Factor Approximations for Planar Graphs (2011) (4)
Tight Approximation for Partial Vertex Cover with Hard Capacities (2019) (4)
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem (2009) (3)
The density maximization problem in graphs (2011) (3)
The multi-service center problem (2012) (3)
An optimal time and minimal space algorithm for rectangle intersection problems (1984) (3)
A Faster One-Dimensional Topological Compaction Algorithm (1997) (3)
(g 0, g 1, ... g k)-Trees and Unary OL Systems (1983) (3)
A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion (2000) (2)
Geometric Algorithm Visualization, Current Status and Future (1996) (2)
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity (2018) (2)
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch (2013) (2)
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization (1999) (2)
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities (2019) (2)
Computational Geometry Ii (2007) (2)
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices (1994) (1)
Constructing Optimal Shortcuts in Directed Weighted Paths (2011) (1)
Connecting Two Trees with Optimal Routing Cost (2011) (1)
On the Crossing Distribution Problem in Two Regions (2004) (1)
k-Best Cuts for Circular-Arc Graphs (1994) (1)
Optimal Time-Convex Hull under the L p Metrics (2013) (1)
The (1|1)-Centroid Problem in the Plane with Distance Constraints (2018) (1)
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities (2016) (1)
The density maximization problem in graphs (2012) (1)
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space (2012) (1)
Maximizing the Number of Independent Labels in the Plane (2007) (1)
Time-Based Voronoi Diagram ∗ (2004) (1)
Record Allocation for Minimizing Seek Delay (1981) (1)
Guest Editors’ Forward (2009) (1)
Optimal time-convex hull for a straight-line highway in Lp-metrics (2016) (1)
Computing and combinatorics : Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997 : proceedings (1997) (1)
QCATION FOR MINIMIZXNG (1981) (0)
Correction to "A New Rapid Acquisition Technique for Direct Sequence Spread Spectrum Communications" (1987) (0)
The (1|1)R-Centroid Problem on the Plane (2016) (0)
Finding Maximum Sum Segments in Sequences with Uncertainty (2011) (0)
The Multi-service Location Problems (2018) (0)
HARMONIC: AN EFFICIENT ONLINE BIN-PACKING. (1984) (0)
6. Concluding Remarks 7. References 5. Experimental Results (1980) (0)
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities (2018) (0)
Optimal Randomized Algorithm for the Density Selection Problem (2009) (0)
Broadcasting in weighted trees under the postal model (2016) (0)
ON MINIMUM COVER OF A SET OF CIRCULAR-ARCS. (1983) (0)
MedialAxisTransformation ofa Planar Shape (1982) (0)
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers (1981) (0)
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints (2016) (0)
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane (1999) (0)
4. Conclusions 5. Acknowledgment 6. References (1981) (0)
Parallel enclosing rectangle on SIMD machines (1992) (0)
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane (2010) (0)
Power Domination in Circular-Arc Graphs (2011) (0)
GEOMETRIC LOCATION PROBLEMS AND THEIR COMPLEXITY* (0)
D. Minimum Cost Minimum Diameter A-tree Heuristic Iii. Minimum Diameter A-tree Algorithm for Pd-msr Problem A. Review of A-tree Algorithm Performance Driven Routing with Multiple Sources (1995) (0)
Online Power-Managing Strategy with Hard Real-Time Guarantees (2013) (0)
A Graph-Theoretic Approach to the Hidden Line Elimination Problem (1985) (0)
Computational geometry (1996) (0)
Rstricted Track Assignment with Applications (1992) (0)
GENERATION OF BINARY TREES OF BOUNDED HEIGHT. (1983) (0)

This paper list is powered by the following services:

Other Resources About Der-Tsai Lee

en.wikipedia.org

What Schools Are Affiliated With Der-Tsai Lee?

Der-Tsai Lee is affiliated with the following schools:

Image Attributions

Image Source for Der-Tsai Lee