**Biography**: Chang-Chien Chou is an associate professor at Lunghwa University of science and technology in Taiwan ROC. He received his BS degree in Information Engineering from Feng Chia University in 1991. He gained a MS degree about Information Management in 2001 from Fu Jen catholic university. He received a PhD degree of Industrial Mangement in National Taiwan University of science and technology in 2007. Chou used to work for Inventec and ASUS of tier 1 computer makers in Taiwan as well as worldwide. His research interests include computer graphics, computational geometry, and algorithms.

**Speech Title**: Linear Time Algorithm for Minimum Conic Link Path in a Simple Polygon

**Abstract**: The conic visibility problem is revisited. We consider the problem of finding, in a simple polygon, from a starting point to a destination point, a piecewise path consisting of conic sections. By considering only one type of conic section, i.e., circular, elliptic, hyperbolic, or parabolic curves, we present a linear time algorithm for computing the path with the minimum number of conic sections. The studied problem is the generalization of its well-known straight line version. We indicate the approach to further exploring the Euclidean shortest conic link path among these minimum conic link paths. The results can be conducted in versatile applications: the hidden surface removal problem in CAD/CAM, the contour tracing, the red-blue intersection problem, the robot motion planning, and related computational geometry applications. The linear time property is most vital for those applications need to take instant reaction.