[Facets-of-complexity] Invitation Link to Monday Lecture & Colloquium October 19th 2020 via zoom

[Ita Brunke <i.brunke@inf.fu-berlin.de>]

Dear all,

please find invitation link for zoom here:

https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09

You may also find the link on our homepage:

http://www.facetsofcomplexity.de/monday/WS-2020-21/index.html

Valid for all Monday Lectures to come for winter term 20/21.

You are cordially invited to our first Monday Lecture & Colloquium since Corona crisis stopped our curriculum.
Monday Lecture & Colloquium will be held online. Invitation for Zoom will follow by Invitor.
First Monday Lecture & Colloquium will start on October 19th 2020 at 14:15 h & 16:00 h.

Online via:
Zoom - Invitation will follow 

Time: Monday, October 19th - 14:15 h

Lecture: Mikkel Abrahamsen (University of Copenhagen)

Title: A framework for ∃R-completeness of two-dimensional packing problems

Abstract:

We show that many natural two-dimensional packing problems are algorithmically equivalent to finding real roots of multivariate polynomials. A two-dimensional packing problem is defined by the type of pieces, containers, and motions that are allowed. The aim is to decide if a given set of pieces can be placed inside a given container. The pieces must be placed so that they are pairwise interior-disjoint, and only motions of the allowed type can be used to move them there. We establish a framework which enables us to show that for many combinations of allowed pieces, containers, and motions, the resulting problem is ∃R-complete. This means that the problem is equivalent (under polynomial time reductions) to deciding whether a given system of polynomial equations and inequalities with integer coefficients has a real solution. We consider packing problems where only translations are allowed as the motions, and problems where arbitrary rigid motions are allowed, i.e., both translations and rotations. When rotations are allowed, we show that the following combinations of allowed pieces and containers are ∃R-complete: - simple polygons, each of which has at most 8 corners, into a square, - convex objects bounded by line segments and hyperbolic curves into a square, - convex polygons into a container bounded by line segments and hyperbolic curves. Restricted to translations, we show that the following combinations are ∃R-complete: - objects bounded by segments and hyperbolic curves into a square, - convex polygons into a container bounded by segments and hyperbolic curves. Joint work by Mikkel Abrahamsen, Tillmann Miltzow, and Nadja Seiferth. The paper has been accepted for FOCS.

Break :

Wherever you are.

Time: Monday, October 19th - 16:00 h s.t.

Colloquium: Tillmann Miltzow (Utrecht University)

Title: A practical algorithm with performance guarantees for the art-gallery problem

Abstract:

Given a closed simple polygon P, we say two points p,q see each other if the segment pq is fully contained in P. The art gallery problem seeks a minimum size set G⊂P of guards that sees P completely. The only known algorithm to solve the art gallery problem exactly is attributed to Sharir and uses algebraic methods. As the art gallery problem is ∃R-complete, it seems impossible to avoid algebraic methods without additional assumptions.

To circumvent this problem, we introduce the notion of vision stability.
In order to describe vision stability, consider an enhanced guard that can see "around the corner" by an angle of δ or a diminished guard whose vision is "blocked" by an angle δ by reflex vertices. A polygon P has vision stability δ if the optimal number of enhanced guards to guard P is the same as the optimal number of diminished guards to guard P. We will argue that most relevant polygons are vision-stable. We describe a one-shot algorithm that computes an optimal guard set for vision-stable polygons using polynomial time besides solving one integer program.

We implemented an iterative version of the vision-stable algorithm. Its practical performance is slower, but comparable to other
state-of-the-art algorithms. Our iterative algorithm is a variation of the one-shot algorithm. It delays some steps and only computes them only when deemed necessary. Given a chord c of a polygon, we denote by n(c) the number of vertices visible from c. The chord-width of a polygon is the maximum n(c) over all possible chords c. The set of vision-stable polygons admits an FPT algorithm when parametrized by the chord-width. Furthermore, the one-shot algorithm runs in FPT time when parameterized by the number of reflex vertices.

Joint work by Simon Hengeveld & Tillmann Miltzow.