Ngoc-Minh Lê

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:99/1326 · DBLP profile ↗

← Back

10ranked-venue papers

8as first author

0since 2021 · last 2004

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 6 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Computational geometry · 54% Algorithmic game theory and mechanism design · 36% Algorithms and data structures · 11%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Algorithmic game theory and mechanism design › graph games pursuit-evasion games	1	1995	On Determining Optimal Strategies in Pursiut Games in the Plane · ICALP 1995
Computational geometry › distance measures convex distance functions	1	1993	Convex Distance Functions in 3-Space are Different · SCG 1993
Computational geometry distance measures	1	1993	Convex Distance Functions in 3-Space are Different · SCG 1993
Algorithms and data structures › search algorithms › combinatorial search optimal strategies	1	1995	On Determining Optimal Strategies in Pursiut Games in the Plane · ICALP 1995

Year	Publication	Venue	Position
2004	Abstract Voronoi diagram in 3-space Ngoc-Minh Lê	J. Comput. Syst. Sci.	1
1998	On Determining Optimal Strategies in Pursuit Games in the Plane Ngoc-Minh Lê	Theor. Comput. Sci.	1
1997	Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space Ngoc-Minh Lê	Comput. Geom.	1
1997	On Non-Smooth Convex Distance Functions Ngoc-Minh Lê	Inf. Process. Lett.	1
1996	On Voronoi Diagrams in the $R^D$ Ngoc-Minh Lê	Discret. Comput. Geom.	1
1995	Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract) Ngoc-Minh Lê	FCT	1
1995	On Determining Optimal Strategies in Pursiut Games in the Plane Ngoc-Minh Lê	ICALP	1
1995	Convex Distance Functions in 3-Space are Different abstract The bisector systems of convex distance functions in 3-space are investigated and it is shown that there is a substantial difference to the Euclidean metric which cannot be observed in 2-space. This disproves the general belief that Voronoi diagrams Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma 0001	Fundam. Informaticae	3
1994	On Voronoi Diagrams in the L_p-Metric in Higher Dimensions Ngoc-Minh Lê	STACS	1
1993	Convex Distance Functions in 3-Space are Different abstract Article Convex distance functions in 3-space are different Share on Authors: Christian Icking View Profile , Rolf Klein View Profile , Ngoc-Minh Lê View Profile , Lihong Ma View Profile Authors Info & Claims SCG '93: Proceedings of the ninth annual symposium on Computational geometryJuly 1993 Pages 116–123https://doi.org/10.1145/160985.161007Published:01 July 1993 12citation252DownloadsMetricsTotal Citations12Total Downloads252Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma 0001	SCG	3