MS-CS-L Archives

February 2009


Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Jyh-Ming Lien <[log in to unmask]>
Reply To:
Jyh-Ming Lien <[log in to unmask]>
Mon, 2 Feb 2009 14:06:45 -0500
text/plain (58 lines)
[Apologies for multiple postings]

Hi All,

Raheem will be talking about approximating convex hulls
next week.

Please come and join us next week.


*    GRAND Seminar
*    Tuesday, Feb 10, 2008. 12:00 pm
*    Room 430A ST2


Raheem Rufai
Department of Computer Science
George Mason University


The convex hull of a point set S, often denoted as conv(S), is the
smallest convex set that contains S. This essentially means that a line
connecting any pair of vertices in S is enclosed by conv(S). This talk
will introduce the convex hull problem and briefly survey existing state
of the art for exact algorithms. The crux of the discussion, however,
will focus on the current state of affairs of approximation algorithms
for the convex hull. The talk might also touch upon related issues such
as kinetization and dynamization of these algorithms and the core-set
framework as time permits.

*Short Bio*

Raimi Rufai is a doctoral student in the CS Department, George Mason
University. His research interests span Computational Geometry, Software
Engineering and enterprise software development and modeling. He is
currently working on his dissertation in Computational Geometry under
the tutelage of Prof. Dana Richards.

Jyh-Ming Lien
Assistant Professor
Department of Computer Science       [log in to unmask]
George Mason University, MSN 4A5
Fairfax, VA, 22030, USA              tel: +1-703-993-9546