Summary of Educational and Professional Background  

Dr. Nguyen Kieu Linh defended her Ph.D. thesis in Applied Mathematics at the University of Science, Vietnam National University, Hanoi, in 2019. That same year, she received a postdoctoral scholarship at the Institute of Computer Science of the Czech Academy of Sciences. In 2021, she continued her postdoctoral research at the Faculty of Information Technology, Ho Chi Minh City University of Technology, funded by the Vingroup Innovation Foundation (VINIF). Since 2018, she has been a lecturer at the Posts and Telecommunications Institute of Technology (PTIT). Her research interests include Computational Geometry, Optimization Theory, and Machine Learning. Specifically, she explores optimization methods in computational geometry with discrete data, such as convex hulls, orthogonal convex hulls, Delaunay triangulations, Voronoi diagrams, and shortest paths, and applies these structures to Machine Learning problems like classification, clustering, image processing, pattern recognition, and anomaly detection. Recently, she has focused on applying these geometric structures to AI algorithms or models to solve practical problems. For example, using the convex hull structure in the Convex Feature Adjustment (CFA) method to detect directed and dense objects, and using orthogonal convex hulls to identify cracks in concrete surfaces, highways, and high-rise buildings.

Lastest information

In 2024, Dr. Linh received a scholarship for outstanding young scientists from the International Center for Mathematical Research and Training, Institute of Mathematics. Additionally, in early 2024, one of her papers was accepted for publication in the journal Applied Mathematics and Computation 481 (2024) 12893 (SCI-E, Q1).

Significant published research studies:
Index Article title Journal name Year
1 Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity. Applied Mathematics and Computation 481 2024
2 Regular 2k-Directional Polygon Algorithm for Finding the Convex Hulls of big data sets in 2D. 2023 RIVF International Conference on Computing and Communication Technologies 2023
3 A Fast and Efficient Algorithm for Determining the Connected Orthogonal Convex Hulls. Applied Mathematics and Computation 429 2022
4 The lifting projection of convex polyhedra for finding Delaunay triangulations . Journal of Convex Analysis 29 (1), 187-200 2022
5  New explicit extragradient methods for solving a class of bilevel equilibrium problems. Bulletin of the Malaysian Mathematical Sciences Society, 44, 3285–3305 2021
6 An efficient improvement of gift-wrapping algorithm for computing the convex hull of a finite set of points in R^n.  Numerical Algorithms (ISSN: 1017-1398), 85, 1499-1518 2020
7 QuickhullDisk: A Faster Convex Hull Algorithm for Disks.  Applied Mathematics and Computation, vol. 363, 124626 2019
8 The Expected Number of Extreme Discs.  VNU Journal of Sciences: Mathematics-Physics, 35(2), 88-93 2019
9 A Projection Method for Variational Inequalities over the Fixed Point Set.  American Journal of Mathematics and Statistics, 8(5), 140-143 2018
10 A Convex Hull Algorithm for Solving a Location Problem. RAIRO – Operations Research, 49 (3), 589 – 600 2015
11 Quicker than Quickhull.  Vietnam Journal of Mathematics, 43 (1), 57-70 2015