WEEKLY ACTIVITIES

Flat View
See by year 		Monthly View
See by month 		Weekly View
See by week 		Daily View
See Today

Category View
Xêmina Hình học tính toán
06 - 9

Seminar on Computational Geometry
Convex hull problem and some applications
Người báo cáo: Nguyễn Kiều Linh (Đại học Thái Nguyên)
13 - 9

Seminar on Computational Geometry
Multiple shooting approach for solving geometric shortest path problems
Người báo cáo: Lê Hồng Trang (Instituto Superior Técnico, Lisbon/K.U. Leuven)
20 - 9

Seminar on Computational Geometry
Multiple shooting approach for solving geometric shortest path problems (cont.)
Người báo cáo: Lê Hồng Trang
10 - 1

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
17 - 1

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

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

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

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

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

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

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

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
22 - 8

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

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

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

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

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

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

Seminar on Computational Geometry
Introduction to JavaView (cont.)
Speaker: Nguyen Thi Thuy Dung
21 - 1

Seminar on Computational Geometry
Finding Shortest Paths among Beta Complex in the Plane (cont.)
Speaker: Dong Van Viet
04 - 2

Seminar on Computational Geometry
Pseudo -geodesics on three dimensional surfaces and Pseudo-geodesic meshes
Speaker: Tran Tuan Viet
13 - 4

Seminar on Computational Geometry
Stable generalization of convex functions
Người báo cáo: Trần Thị Hương Trà
13 - 5

Seminar on Computational Geometry
The funnel algorithm for finding the shortest paths between two specified points in an simple polygon
Speaker: Dang Ngoc Anh
21 - 5

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
28 - 5

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
02 - 6

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
07 - 8

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
14 - 8

Seminar on Computational Geometry
s-Quasiconvexity Functions
Speaker: Tran Thi Huong Tra
21 - 8

Seminar on Computational Geometry
Shortest Paths along a Sequence of Triangles
Speaker: Phong Thi Thu Huyen
28 - 8

Seminar on Computational Geometry
Visualization of some properties of the straight geodesics in 3D on JavaView
Speaker: Nguyen Thi Thuy Dung
04 - 9

Seminar on Computational Geometry
Computing shortest paths from edge to edge in a simple polygon
Speaker: Tran Tuan Viet
11 - 9

Seminar on Computational Geometry
Computing shortest paths from edge to edge in a simple polygon (cont.)
Speaker: Tran Tuan Viet
18 - 9

Seminar on Computational Geometry
Funnels for finding shortest paths between two points along a sequence of triangles in 3D
Speaker: Dinh Thanh Giang
25 - 9

Seminar on Computational Geometry
Visualization of some properties of the straight geodesics in 3D on JavaView (cont.)
Speaker: Nguyen Thi Thuy Dung
02 - 10

Seminar on Computational Geometry
s-Quasiconvexity Functions (cont.)
Speaker: Tran Thi Huong Tra
09 - 10

Seminar on Computational Geometry
Shortest paths and their properties in low dimensions
Speaker: Phong Thi Thu Huyen
02 - 12

Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces
Speaker: Nguyen Thi My Hanh
07 - 12

Seminar on Computational Geometry
A Short Introduction to the Computational Geometry Algorithms Library (CGAL)
Speaker: Le Hong Trang
17 - 12

Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces (cont.)
Speaker: Nguyen Thi My Hanh
24 - 12

Seminar on Computational Geometry
On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces (cont.)
Speaker: Nguyen Thi My Hanh
30 - 12

Seminar on Computational Geometry
An Implementation of Chen and Han's Shortest Paths Algorithm by Kaneva and O'Rourke
Speaker: Dong Van Viet
06 - 1

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

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

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

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

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

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

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

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

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