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
| 29/11/24, Conference: ICTP and Vietnamese Science: Celebrating 60 Years of Collaborations |
| 02/12/24, Conference: International workshop on “Commutative Algebra and related Combinatoric structures” |
