Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, September 27, 2016, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Miloš Stojaković (University of Novi Sad)
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position, we present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algorithm of cubic time complexity. Joint work with Marko Savic.
Automatic MiSe System Software Version 1.4803M | admin login