Algolunch on Wed, January 20th

by

Next week, Perouz will recap our best bounds on the “Matching point with things” problem: given a set of points and of geometric objects, is it possible to draw non-crossing segments connecting each point to its corresponding object?

We studied this problem, but there is still a lot to improve, in particular the complexity of some of our algorithms is far from tight.

About these ads

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


Follow

Get every new post delivered to your Inbox.

%d bloggers like this: