Monday, February 25, 2019

[DMANET] First Announcement: Geometric Optimization Challenge, part of CG Week 2019

Dear colleagues,

We are happy to announce a Geometric Optimization Challenge as part of the workshop
"Computational Geometry: Solving Hard Optimization Problems" (CG:SHOP), which will
take place as part of CG Week in Portland, OR, USA, June 18-21, 2019.

CG:SHOP will focus on difficult geometric optimization problems, both in theory and
practice. Contributions are sought in two different directions, as follows.

(1) First, we will host a practical OPTIMIZATION CHALLENGE. The objective
will be to compute good solutions to instances of an NP-hard geometric
optimization problem:

Given a set S of n points in the plane, compute a simple polygon, whose vertex set is precisely
the set S, that has maximum or minimum area among all such polygonalizations of S.

Details of the competition (including further details such as benchmark
instances, and rules for submission and evaluation) will be announced through
the website:
Contest opens 24:00 (midnight, CET), February 28, 2019.
Contest closes 24:00 (midnight, CET), May 31, 2019.

Winners will be presented during the workshop at CG Week.

(2) Second, you are invited to submit OPEN PROBLEMS for presentation during an open
problem session. Details of how to submit contributions will be provided through the website:
starting February 28, 2019. In order to allow sufficient time for collecting and preloading presentations,
contributions are encouraged by June 11, 2019.

In addition, we will host presentations and meta-discussions about the future of open problems.

We are looking forward to your contributions and welcome questions and comments!

Erik Demaine, Sándor Fekete, Joe Mitchell
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.