Campus Event Calendar
Event Entry
New for: D3
What and Who
On the size of a 3-d Delaunay triangulation as a function of the "spread"
Edgar Ramos
Max-Planck-Institut für Informatik - AG 1
SIG Meeting
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 10 October 2000
16:00
75 Minutes
MPII
007
Saarbrücken
Abstract
The Delaunay triangulation of a set of n points in 3-D has size
$O(n^2)$. The known examples that achieve the quadratic upper
bound have large spread (ratio between largest and smallest
interpair distance). I´ll talk about a conjecture of J. Erickson
according to which the size is $O(n^{1/2}\Delta^{3/2})$ where
$\Delta$ is the spread, and some of his initial attempts to
prove it.
Contact
Edgar A. Ramos
--email hidden
passcode not visible
logged in users only