Home
About the School
Contact and People
Future Undergraduate Students
Prospective Postgraduates
Current Students
Current Postgraduates
Research
IT News
Awards
Industry Links and Prizes
School and IT Information
Other
Internal Information
|
Research Seminars - October 30, 1998
Seminar Announcement
| Title: |
Efficient Enumeration of Extreme Points in Higher Dimensions
|
| Speaker: |
Laxmi |
| |
Computer Science |
| Date: |
Friday 30th October, 1998 |
| Time: |
3pm |
| Venue: |
Seminar Room 1.24 |
Abstract
The extreme points of a point set are the vertices of its convex
hull. In this talk, we present an efficient and output-sensitive
algorithm for enumerating extreme points of a point set in any
dimension d. Our algorithm runs in O(nm) time and O(n) space when the
dimension d is fixed. Here, n is the total number of points in the set
and m is the total number of extreme points reported. This improves
the previously best known complexity for this problem when m<=4.
|
|