Computational Problems in Geometry

Organizers: Phan Thanh An and Deok-Soo Kim

Ord.	Authors	Title
1	P. T. An T. V. Hoai D.-S. Kim K. Polthier V. B. Thinh D. V. Viet	Funnel Technique for Finding Shortest Paths from a Fixed Source Point to all Destination Points on a Convex Polyhedral Surface
2	P. T. An N. D. Hoang N. K. Linh N. B. Hau	The Best Restricted Area Technique for Computing the Convex Hull of a Finite Set of Points in Rⁿ
3	D.-S. Kim Y. Cho J. Ryu M. Lee J. Cha C. Song	Molecular Geometry (MG) and MG Operating System: Software Engine Library for 2D- and 3D-sphere based Particle System
4	M. Lee J. Ryu J. Cha C. Song D.-S. Kim	Topology-oriented Construction of the Voronoi Diagram of Polygons
5	X. Qin N. T. An	Smoothing Algorithms for Computing the Projection onto a Minkowski Sum of Convex Sets
6	J. Ryu M. Lee D.-S. Kim	How to Solve NP-hard Euclidean Geometry Problems: From Disk Packing Problem Point of View
7	C. Song J. Cha M. Lee D.-S. Kim	The Geodesic among Circular Obstacles in Plane
8	D. Wagner	Geometric DNA Alignment with Range Trees
9	S. K. Yadav F. Paul K. Polthier	Shape Analysis of 3D SDOCT data

Minisymposium