WEEKLY ACTIVITIES

On Chen and Han’s algorithm for finding the shortest paths on polyhedral surfaces
Speaker: Nguyen Thi My Hanh

Time: 14h00, Wednesday, December 2, 2015
Location: Room 212, Building A5, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: In this report, we present Chen and Han's algorithm introduced in 1990 for determining the shortest path between two arbitrary points on the surface of a convex polyhedron or a non-convex polyhedron. The algorithm uses a "Continuous Dijkstra" technique based on the key observation “one angle one split” with O(n2) complexity. In addition, Kavena and O'Rourke's implementation in 2000 is presented.

Back

Highlights

23/04/24, Conference:
Some recent progress on selected problems in number theory
26/04/24, Conference:
Hội thảo Tối ưu và Tính toán khoa học lần thứ 22
28/05/24, Conference:
Hội nghị Đại số - Lý thuyết số - Hình hoc - Tô pô 2024
28/10/24, Conference:
School and Workshop “Selected topics in Arithmetic Algebraic Geometry”

New Scientiffic Publications