Optimal Triangulation of Area

Tzvetalin Vassilev Ph.D. Student Department of Computer Science University of Saskatchewan

DEPARTMENT SEMINAR DATE: Monday, September 15, 2003 TIME: 3:30 pm PLACE: Agriculture 2D77 *** Everyone is welcome ***

Abstract

Triangulations are one of the most studied topics in Computational Geometry over the last three decades.The field has rich variety of algorithmic approaches to computing and optimizing triangulations. There are many challenging problems that are still open. This talk will focus on one optimization criterion - the area of an individual triangle within the triangulation. For the restricted case of a convex polygon, we will present geometric properties of and efficient algorithms for constructing both the MaxMin and MinMax area triangulations. We will also provide discussion about the relationship between the decision and optimization problems, and overview of the (still) unanswered questions related to this research.

About the speaker

Tzvetalin is a PhD. student in Computer Science at the university of Saskatchewan. He was born in Pernik, Bulgaria, 1971. He graduated from the National College of Mathematics and Natural Sciences with the Ministry of Education Award of Academic Excellence (only two awards given the same year nationwide) in Sofia, Bulgaria, 1989 in the Mathematics class of Prof. nedyalko nenov and Prof. Nikolay Hadjiivanov. He also received his M.Sc. (P.Eng.) degree in Computer Science from the Technical University, Sofia, Bulgaria in 1994. He holds a B.Ed., (or B.Sc. in Education) degree from the same university, received in 1992. Tzvetalin joined the Department of Computer Science in January 2000 as an M.Sc. student, in September 2001 and was transferred to the Ph.D. he is married with a baby daughter born here in Canada in 2002.

[an error occurred while processing this directive]