Thanh An Phan

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 7

Top Topics

Totally Unimodular

Finite Set Of Points

Top Venues

J. Comput. Appl. Math.

Appl. Math. Comput.

J. Comput. Sci.

J. Glob. Optim.

Publications

Thanh An Phan, Nguyen Thi Le, Le Hong Trang, Raymond Chi-Wing Wong
Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting. J. Comput. Sci. 67 (2023)
Thanh An Phan, Hoang Xuan Phu
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves. J. Glob. Optim. 85 (4) (2023)
Nguyen Kieu Linh, Thanh An Phan, Tran Van Hoai
A fast and efficient algorithm for determining the connected orthogonal convex hulls. Appl. Math. Comput. 429 (2022)
Thanh An Phan, Nam-Dung Hoang, Nguyen Kieu Linh
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$. Numer. Algorithms 85 (4) (2020)
Nguyen Kieu Linh, Chanyoung Song, Joonghyun Ryu, Thanh An Phan, Nam-Dung Hoang, Deok-Soo Kim
QuickhullDisk: A faster convex hull algorithm for disks. Appl. Math. Comput. 363 (2019)
Tran Van Hoai, Thanh An Phan, Nguyen Ngoc Hai
Multiple shooting approach for computing approximately shortest paths on convex polytopes. J. Comput. Appl. Math. 317 (2017)
Le Hong Trang, Attila Kozma, Thanh An Phan, Moritz Diehl
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. Optim. Methods Softw. 31 (1) (2016)
Thanh An Phan, Thanh Giang Dinh
A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D. ICCSAMA (2015)
Thanh An Phan, Nguyen Ngoc Hai, Tran Van Hoai, Le Hong Trang
On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems. Trans. Large Scale Data Knowl. Centered Syst. 16 (2014)
Thanh An Phan, Nguyen Ngoc Hai, Tran Van Hoai
Direct multiple shooting method for solving approximate shortest path problems. J. Comput. Appl. Math. 244 (2013)
Thanh An Phan, Le Hong Trang
A parallel algorithm based on convexity for the computing of Delaunay tessellation. Numer. Algorithms 59 (3) (2012)
Hoang Xuan Phu, V. M. Pho, Thanh An Phan
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations. J. Optim. Theory Appl. 149 (1) (2011)
N. N. Hai, Thanh An Phan
Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets. J. Optim. Theory Appl. 151 (3) (2011)
Thanh An Phan
Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes without Triangulation. Int. J. Robotics Autom. 25 (4) (2010)
Thanh An Phan, Vuong Thi Thao Binh
Stability of excess Demand Functions with Respect to a Strong Version of Wald's Axiom. Asia Pac. J. Oper. Res. 26 (4) (2009)