Seminar on Computational Geometry
The funnel algorithm for finding the shortest paths between two specified points in an simple polygon
Speaker: Dang Ngoc Anh
Seminar on Computational Geometry
The funnel algorithm for finding the shortest paths between two specified points in an simple polygon (cont.)
Speaker: Dang Ngoc Anh
Seminar on Computational Geometry
Chand and Kapur’s Gift-wrapping Algorithm for Determining the Convex Hull of a Finite Set of Points in R^d
Speaker: Nguyen Kieu Linh
|
Highlights
| 20/12/24, Colloquium Lecture: New matrix perturbation bounds via “skewness”: theory and applications. |
| 06/01/25, Conference: Geometry and Dynamics in Low Dimensions |
| 06/01/25, Conference: The 3rd Vietnam - Korea joint workshop on selected topics in mathematics |
| 21/07/25, Conference: International conference on commutative algebra to the memory of Jürgen Herzog |
