Talks

International Conferences, Workshops and Seminar Talks since 2000:

• 1. Computational geometry for autonomous robots,  16th International Conference on Advanced COMPuting and Analytics (ACOMPA), HCM City, Vietnam, November 23-25, 2022.  (Keynote) 

  2. Finding approximately shortest paths between two points along the sequences of bundles of line segments and an application in robotics,  held online at Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, April 27, 2022.

  3. Physarum-inspired algorithms for finding geometric shortest constrained paths in 2D and 3D, TUWien, Vienna, Austria, March 13, 2020.

  4. Optimization methods for computational geometry,  13th International  Workshop on Advanced Computing and Applications, Nha Trang, Vietnam, November 27-29, 2019.  (Keynote)

  5. Optimization methods for shortest constrained path problems, ZIB and TU Berlin, Germany,  November  1-10, 2019.

  6. Method of multiple shooting for computing shortest gentle paths, Department of Computer Science and Engineering, the Hong Kong University of Science and Technology (HKUST), Hong Kong, August 1, 2019.

  7. The law of cosines for computing geometric shortest paths on a convex polytope in 3D, Oberseminar "Geometry & Visualization",  AG Mathematical Geometry Processing group, Freie Universitaet  Berlin, Germany, December 13, 2018.

  8. Finding shortest paths in 3D: Unfold or not unfold?   Simulation and Optimization seminar,  IWR, University of Heidelberg, Germany,  November 30, 2018.

  9. Method of multiple shooting for computing geometric shortest constrained paths in 3D  (contributed talk),  International Congress on Mathematics (ICM),  Rio de Janario, Brasil, August 1-8, 2018.

  10. Optimization approach for computing shortest constrained paths, Seminário de Computação Gráfica, IMPA - Instituto de Matematica Pura e Aplicada, Rio de Janeiro, RJ, Brasil,  3 de agosto de 2018.

  11. Optimization approaches for computational geometry/computer graphics,  Departamento de Ciências de Computação seminar, Instituto de Ciências Matemáticas e de Computação, University of São Paulo, Brasil, April 11, 2018.

  12. Computational geometry: an overview, Tópicos em Computação e Matemática Computacional II, Instituto de Ciências Matemáticas e de Computação , University of São Paulo, Brasil, Nov. 8, 2017.

  13. Method of multiple shooting for computing shortest constrained paths, Department of Computer Science and Engineering, the Hong Kong University of Science and Technology (HKUST), Hong Kong, May 24, 2017.

  14. Funnel trees for shortest paths on polytopes, Voronoi research center, Hanyang University,  Seoul, Korea, May 10, 2017.

  15. Finding shortest paths from the source point to all destination points on convex polytopes,  Oberseminar "Geometry & Visualization", AG Mathematical Geometry Processing, Freie Universitaet Berlin, Germany, November 24, 2016.

  16. Method of multiple shooting for computing shortest descending paths on convex terrains, HGS MathCom seminar, University of Heidelberg, Germany, November 3, 2016.

  17. Method of orienting curves for computational geometry, The Asian Mathematical Conference 2016, Bali, Indonesia, July 25-29, 2016.

  18. Method of multiple shooting for solving geometric shortest path problems, HGS MathComp seminar, IWR, University of Heidelberg, Germany, November 5, 2015.

  19. Method of multiple shooting for ODE boundary value problems and application for finding geometric shortest paths, Fifth International Workshop on Analysis and Numerical Approximation of Singular Problems, Lagos, Portugal, Oct. 22-24, 2015.

  20. Straightest geodesics on a triangle sequence in 3D, Third ERC "SDModels" Workshop - Discrete Models in Geometry and Topology, Freie Universitaet Berlin, Germany, March 23-26, 2015. (invited talk).

  21. Straightest geodesics for finding exact shortest paths inside a triangle sequence in 3D without unfolding, AG Mathematical Geometry Processing seminar, Freie Universitaet  Berlin, December 4, 2014.

  22. Optimization approaches for computing geometric shortest paths (contributed talk), International Congress on Mathematics (ICM), Seoul, Korea, August 12-21, 2014.

  23. Method of orienting curves for solving convex hull problems, Voronoi research center, Hanyang University,  Seoul, Korea, August 18, 2014.

  24. The role of graphs for solving some geometric shortest path problems in 2D and 3D, 5th FTRA International Conference on Computer Science and its Applications (CSA-13), Danang, Vietnam, Dec. 18-21, 2013.

  25. Optimization methods for computational geometry, International Conference on Continuous Optimization Lisbon, Portugal, July 27-August 1, 2013. (invited talk).

  26. Numerical optimization methods for computing Euclidean shortest paths in polygons and on polytopes, The Asian Mathematical Conference 2013, Busan, Korea, June 30-July 4, 2013.

  27. The role of convexity for solving some shortest path problems in the plane without triangulation, International Conference on Mathematical Sciences and Statistics, Kuala Lump, Malaysia, Feb. 5-7, 2013.

  28. Method of orienting lines for minimizing a sum of Euclidean norms, Mathematics, Algorithms, and Proofs, Konstanz, Germany, September 17 - 21, 2012.

  29. Direct multiple shooting method for finding approximate shortest paths in polygonal environments, 6th International Conference on Inverse Problems, Control and Shape Optimization, Palaiseau, France, April 2 - 4, 2012.

  30. Numerical optimization methods for shortest path problems in 2D and 3D, Workshop on Multiscale Modeling, Simulation, Analysis and Applications, Institute for Mathematical Sciences, National University of Singapore, Dec. 19-21, 2011.

  31. Numerical optimization methods for some shortest path problems inside simple polygons, 25th IFIP TC 7 Conference on System Modeling and Optimization, Berlin, Germany, September 12-16, 2011.

  32. Convexity helps solve some shortest path problems, Seminário Matemática Aplicada e Análise Numérica, Centro de Matemática Computacional e Estocástica, Instituto Superior Técnico, Universidade de Lisboa, Portugal, June 22, 2011.

  33. Incremental convex hull as an orientation to solving the shortest path problem,  IEEE 3rd International Conference on Computer and Automation Engineering, Chongqing, China, Jan. 21-23, 2011.

  34. An efficient algorithm for the shortest path problem inside simple polygons without triangulation, International  Workshop on Advanced Computing and Applications (ACOMP), Ho Chi Minh City, Vietnam, March 3-5, 2010.