Thanh An Phan

Orcid: 0000-0002-1903-3510

According to our database1, Thanh An Phan authored at least 15 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves.
J. Glob. Optim., April, 2023

Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting.
J. Comput. Sci., March, 2023

2022
A fast and efficient algorithm for determining the connected orthogonal convex hulls.
Appl. Math. Comput., 2022

2020
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$.
Numer. Algorithms, 2020

2019
QuickhullDisk: A faster convex hull algorithm for disks.
Appl. Math. Comput., 2019

2017
Multiple shooting approach for computing approximately shortest paths on convex polytopes.
J. Comput. Appl. Math., 2017

2016
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints.
Optim. Methods Softw., 2016

2015
A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D.
Proceedings of the Advanced Computational Methods for Knowledge Engineering - Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications, 2015

2014
On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems.
Trans. Large Scale Data Knowl. Centered Syst., 2014

2013
Direct multiple shooting method for solving approximate shortest path problems.
J. Comput. Appl. Math., 2013

2012
A parallel algorithm based on convexity for the computing of Delaunay tessellation.
Numer. Algorithms, 2012

2011
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations.
J. Optim. Theory Appl., 2011

Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets.
J. Optim. Theory Appl., 2011

2010
Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes without Triangulation.
Int. J. Robotics Autom., 2010

2009
Stability of excess Demand Functions with Respect to a Strong Version of Wald's Axiom.
Asia Pac. J. Oper. Res., 2009


  Loading...