WEEKLY ACTIVITIES
Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces
Speaker: Nguyen Thi My Hanh
Seminar on Computational Geometry
A Short Introduction to the Computational Geometry Algorithms Library (CGAL)
Speaker: Le Hong Trang
Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces (cont.)
Speaker: Nguyen Thi My Hanh
Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces (cont.)
Speaker: Nguyen Thi My Hanh
Seminar on Computational Geometry
An Implementation of Chen and Han's Shortest Paths Algorithm by Kaneva and O'Rourke
Speaker: Dong Van Viet
Seminar on Computational Geometry
s-Quasiconvexity Functions (cont.)
Speaker: Tran Thi Huong Tra
Seminar on Computational Geometry
Shortest paths and their properties in low dimensions
Speaker: Phong Thi Thu Huyen
Seminar on Computational Geometry
Computing shortest paths from edge to edge in a simple polygon
Speaker: Tran Tuan Viet
Seminar on Computational Geometry
Computing shortest paths from edge to edge in a simple polygon (cont.)
Speaker: Tran Tuan Viet
Seminar on Computational Geometry
Funnels for finding shortest paths between two points along a sequence of triangles in 3D
Speaker: Dinh Thanh Giang
Seminar on Computational Geometry
Visualization of some properties of the straight geodesics in 3D on JavaView (cont.)
Speaker: Nguyen Thi Thuy Dung
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
s-Quasiconvexity Functions
Speaker: Tran Thi Huong Tra
Seminar on Computational Geometry
Shortest Paths along a Sequence of Triangles
Speaker: Phong Thi Thu Huyen
Seminar on Computational Geometry
Visualization of some properties of the straight geodesics in 3D on JavaView
Speaker: Nguyen Thi Thuy Dung
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
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
Seminar on Computational Geometry
Stable generalization of convex functions
Người báo cáo: Trần Thị Hương Trà
Seminar on Computational Geometry
Pseudo -geodesics on three dimensional surfaces and Pseudo-geodesic meshes
Speaker: Tran Tuan Viet
Seminar on Computational Geometry
Introduction to JavaView (cont.)
Speaker: Nguyen Thi Thuy Dung
Seminar on Computational Geometry
Finding Shortest Paths among Beta Complex in the Plane (cont.)
Speaker: Dong Van Viet
|
Highlights
New Scientiffic Publications
- Florian Bridoux, Christophe Crespelle, Phan Thi Ha Duong, Adrien Richard, Dividing Permutations in the Semiring of Functional Digraphs. In Cellular Automata and Discrete Complex Systems. AUTOMATA 2024. Lecture Notes in Computer Science, vol 14782. Springer, Cham.
- Le Mau Hai, Pham Hoang Hiep, Trinh Tung, Cone of Maximal Subextensions of the Plurisubharmonic Functions, Acta Mathematica Vietnamica, Volume 49, (2024), pages 83–97, (Scopus).
- Ngo Trung Hieu, A matrix variant of the Erdős-Falconer distance problems over finite field, Linear Algebra and its Applications, Volume 694 (2024), Pages 335-359, (SCI-E, Scopus).