Kevin Moule
Klee's Measure Problem
In 1977, Victor Klee posed the following problem. Given a set of intervals on the real line compute the length of their union. An optimal solution to this problem was easily constructed. This problem is readily extended into higher dimensions for which tight upper and lower bounds are not known.
I will be giving an overview of the history of the problem, descriptions of the algorithms I implemented for my CS760M project and the results from the project.
Hewlett-Packard
5150 Spectrum Way
Mississauga
Thursday, June 1, 3:00pm
RSVP Kim Rogers-Rollins, CIMETRIX (905)470-6624
kim@cimetrix.on.ca