We stand with Ukraine

We stand with Ukraine

Thanh An Phan

Orcid: 0000-0002-1903-3510

According to our database¹, Thanh An Phan authored at least 20 papers between 2009 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on researcherid.com
on orcid.org

On csauthors.net:

Bibliography

2024

Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D.

[BibT_eX]

[DOI]

,

J. Comb. Optim., July, 2024

OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations.

[BibT_eX]

[DOI]

,

,

Discret. Math. Algorithms Appl., February, 2024

2023

Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves.

[BibT_eX]

[DOI]

,

J. Glob. Optim., April, 2023

Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting.

[BibT_eX]

[DOI]

,

,

,

Raymond Chi-Wing Wong

J. Comput. Sci., March, 2023

2022

Blaschke, Separation Theorems and some Topological Properties for Orthogonally Convex Sets.

[BibT_eX]

[DOI]

,

CoRR, 2022

Finding Approximately Convex Ropes in the Plane.

[BibT_eX]

[DOI]

,

,

CoRR, 2022

A fast and efficient algorithm for determining the connected orthogonal convex hulls.

[BibT_eX]

[DOI]

Nguyen Kieu Linh

,

,

Appl. Math. Comput., 2022

2021

A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set.

[BibT_eX]

[DOI]

,

Phong Thi Thu Huyen

,

Appl. Math. Comput., 2021

2020

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

[BibT_eX]

[DOI]

,

,

Nguyen Kieu Linh

Numer. Algorithms, 2020

2019

QuickhullDisk: A faster convex hull algorithm for disks.

[BibT_eX]

[DOI]

Nguyen Kieu Linh

,

,

,

,

,

Appl. Math. Comput., 2019

2017

Multiple shooting approach for computing approximately shortest paths on convex polytopes.

[BibT_eX]

[DOI]

,

,

Nguyen Ngoc Hai

J. Comput. Appl. Math., 2017

2016

A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints.

[BibT_eX]

[DOI]

,

,

,

Optim. Methods Softw., 2016

2015

A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D.

[BibT_eX]

[DOI]

,

Thanh Giang Dinh

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.

[BibT_eX]

[DOI]

,

Nguyen Ngoc Hai

,

,

Trans. Large Scale Data Knowl. Centered Syst., 2014

2013

Direct multiple shooting method for solving approximate shortest path problems.

[BibT_eX]

[DOI]

,

Nguyen Ngoc Hai

,

J. Comput. Appl. Math., 2013

2012

A parallel algorithm based on convexity for the computing of Delaunay tessellation.

[BibT_eX]

[DOI]

,

Numer. Algorithms, 2012

2011

Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations.

[BibT_eX]

[DOI]

,

,

J. Optim. Theory Appl., 2011

Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets.

[BibT_eX]

[DOI]

,

J. Optim. Theory Appl., 2011

2010

Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes without Triangulation.

[BibT_eX]

[DOI]

Int. J. Robotics Autom., 2010

2009

Stability of excess Demand Functions with Respect to a Strong Version of Wald's Axiom.

[BibT_eX]

[DOI]

,

Vuong Thi Thao Binh

Asia Pac. J. Oper. Res., 2009

Loading...