Seminar on Computational Geometry
Computing Shortest Paths among Beta Complex in the Plane
Speaker: Dong Van Viet

Seminar on Computational Geometry
The Restricted Method for Determining the Convex Hull of a Finite Set of points in 3D
Speaker:: Nguyen Kieu Linh

Seminar on Computational Geometry
Straightest Geodesics for Finding Shortest Paths inside a Sequence of Faces in 3D
Speaker: Phong Thi Thu Huyen

Seminar on Computational Geometry
Introduction to JavaView
Speaker: Le Hong Trang

Seminar on Computational Geometry
On Li and Klette's approximate algorithm for finding a shortest path between two points on the surface of a convex polyhedron and some examples
Speaker: Vu Ngoc Thuy Duong

Seminar on Computational Geometry
The incremental Delaunay triangulation algorithm in the plane
Speaker: Phung Thi Hoat

Seminar on Computational Geometry
On an exact shortest path algorithm on polyhedral surfaces
Speake: Phan Duc Minh

Seminar on Computational Geometry
Chen and Han's shortest paths algorithm
Speaker: Nguyễn Thị Mỹ Hạnh

Seminar on Computational Geometry
Chen and Han's shortest paths algorithm (cont.)
Speaker: Nguyễn Thị Mỹ Hạnh

Seminar on Computational Geometry
Convex sets on polyhedral surfaces
Speaker: Phong Thi Thu Huyền

Seminar on Computational Geometry
Finding Convex Hulls in 3 dimensions
Speaker: Nguyễn Kiều Linh

Seminar on Computational Geometry
Weighted Erdos-Mordell inequality for star-shaped polygons
Speaker: Trần Nhật Tân

Seminar on Computational Geometry
On Li and Klette's approximate algorithm for finding a shortest path between two vertices on the surface of a convex polyhedron
Speaker: Vu Ngoc Thuy Duong

Seminar on Computational Geometry
Extreme points under random noise
Speaker: Nguyễn Kiều Linh (Đại học Thái Nguyên)

Seminar on Computational Geometry
Straightest geodesics on polyhedral surfaces
Speaker; Phong Thi Thu Huyen