Seminar on Computational Geometry
Shortest paths for disc obstacles
Speaker: Dong Van Viet

Seminar on Computational Geometry
Shortest paths for disc obstacles (cont.)
Speaker: Dong Van Viet

Seminar on Computational Geometry
Method of orienting curves for solving optimal control problems with state constraints
Speaker: Nguyen Thi Quyen

Seminar on Computational Geometry
Method of orienting curves for solving optimal control problems with state constraints (cont.)
Speaker: Nguyen Thi Quyen

Seminar on Computational Geometry
Dùng JavaView thể hiện trên máy tính đường đi ngắn nhất giữa 2 điểm trên bề mặt khối đa diện
Speaker: Dang Thi Ngoc Anh

Seminar on Computational Geometry
Một kỹ thuật hạn chế tính bao lồi dưới cho lớp bài toán xác định Voronoi Diagrams
Speaker: Nguyen Kieu Linh

Seminar on Computational Geometry
Funnel Technique for Finding Shortest Paths from the Source Point to all Destination Points on a Convex Polyhedral Surface (cont.)
Speaker: Dong Van Viet

Seminar on Computational Geometry
Funnel Technique for Finding Shortest Paths from the Source Point to all Destination Points on a Convex Polyhedral Surface (cont.)
Speaker: Dong Van Viet

Seminar on Computational Geometry
Ứng dụng kỹ thuật "Phễu" tìm đường đi ngắn nhất giữa 2 điểm dọc theo một dãy mặt tam giác nằm trên bề mặt khối đa diện (tiếp tục)
Người báo cáo: Đặng Ngọc Ánh

Seminar on Computational Geometry
Kỹ thuật “phễu” của Lee và Preparata tìm đường đi ngắn nhất giữa hai điểm trong đa giác đơn
Speaker: Dang Thi Ngoc Anh

Seminar on Computational Geometry
Incremental algorithm for computing convex hulls of finite point sets in plane
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Ứng dụng kỹ thuật "Phễu" tìm đường đi ngắn nhất giữa 2 điểm dọc theo một dãy mặt tam giác nằm trên bề mặt khối đa diện.
Speaker: Dang Ngoc Anh

Seminar on Computational Geometry
Ứng dụng kỹ thuật "Phễu" tìm đường đi ngắn nhất giữa 2 điểm dọc theo một dãy mặt tam giác nằm trên bề mặt khối đa diện.
Speaker: Dang Ngoc Anh

Seminar on Computational Geometry
Funnel Technique for Finding Shortest Paths from the Source Point to all Destination Points on a Convex Polyhedral Surface
Speaker: Dong Van Viet

Seminar on Computational Geometry
Approximate Shortest Gentle Paths on Terrains
Speaker: Nguyen Thanh Long

Seminar on Computational Geometry
An implementation in C for finding the intersection of two segments in three dimensional space
Speaker: Dong Van Viet

Seminar on Computational Geometry
An implementation in C for finding the intersection of two segments in three dimensional space (cont.)
Speaker: Dong Van Viet

Seminar on Computational Geometry
Incremental convex hull as an orientation to solving the shortest path problem
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Incremental convex hull as an orientation to solving the shortest path problem (cont.)
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Incremental convex hull as an orientation to solving the shortest path problem (cont.)
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Ứng dụng kỹ thuật Phễu tìm đường đi ngắn nhất giữa 2 điểm dọc theo một dãy mặt tam giác nằm trên bề mặt khối đa diện.
Speaker: Dang Ngoc Anh

Seminar on Computational Geometry
Approximate Shortest Gentle Paths on Terrains
Speaker: Nguyen Thanh Long

Seminar on Computational Geometry
Shortest Ordered Paths along a Sequence of Adjacent Faces of a Polytope
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Straightest paths and discrete initial value problem on a sequence of convex faces in 3D
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Approximate Shortest Gentle Paths on Terrains
Speaker: Nguyen Thanh Long

Seminar on Computational Geometry
Approximate Shortest Gentle Paths on Terrains (cont.)
Speaker: Nguyen Thanh Long

Seminar on Computational Geometry
Optimization approaches for computing geometric shortest paths (cont.)
Speaker: Phan Thanh An

Seminar on Computational Geometry
Euclidean shortest paths on a sequence of triangles in 3D
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Euclidean shortest paths on a sequence of triangles in 3D (cont.)
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Euclidean shortest paths on a sequence of triangles in 3D (cont.)
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Optimization approaches for computing geometric shortest paths
Speaker: Phan Thanh An

Seminar on Computational Geometry
Optimization approaches for computing geometric shortest paths (cont.)
Speaker: Phan Thanh An

Seminar on Computational Geometry
A multiple shooting approach for finding approximately shortest paths on convex polytopes
Speaker: Tran Tuan Viet

Seminar on Computational Geometry
A multiple shooting approach for finding approximately shortest paths on convex polytopes (cont.)
Speaker: Tran Tuan Viet

Seminar on Computational Geometry
One angle one split technique for finding the shortest paths on polyhedral surfaces
Speaker: Nguyen Thi My Hanh

Seminar on Computational Geometry
C/C++ program and computations
Speaker: Nguyen Ngoc Chien

Seminar on Computational Geometry
An Implementation of Chen and Han's Shortest Paths Algorithm by Kaneva and O'Rourke (cont.)
Speaker: Dong Van Viet

Seminar on Computational Geometry
An Implementation of Chen and Han's Shortest Paths Algorithm by Kaneva and O'Rourke (cont.)
Speaker: Dong Van Viet