EuroCG 2019

The conference will take place on March 18-20, with a reception on Sunday, 17 March. The conference will end on Wednesday, 20 March at 16:00.

The programme will feature invited talks by three speakers:

Oskar van Deventer, Puzzle designer
Vera Sacristán, Universitat Politècnica de Catalunya
Jeff Erickson, University of Illinois Urbana-Champaign

A list of accepted papers can be found here. An outline of the conference programme can be seen below. A pdf version is available here.

Sessions

Below is the detailed programme. Papers presented by students have a yellow background. You will be asked to vote for a Best Student Presentation Award.

Monday, 18 March

9:00-9:15	Welcome
9:15-10:15	Invited talk: Oskar van Deventer Geometry and mechanical puzzles
10:15-10:30	Fast-Forward 1

	Session 1A: Rectilinear Geometry Session chair: Maarten Löffler	Session 1B: Geometric Graphs Session chair: Michael Hoffmann
11:00-11:15	Computing the Straight Skeleton of an Orthogonal Monotone Polygon in Linear Time Günther Eder, Martin Held and Peter Palfrader	Terrain-Like and Non-Jumping Graphs Stav Ashur, Omrit Filtser and Rachel Saban
11:15-11:30	Maximum Rectilinear Convex Subsets Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel and Jorge Urrutia	Recognizing Planar Laman Graphs Jonathan Rollin, Lena Schlipf and André Schulz
11:30-11:45	Routing in Histograms Man Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen and Max Willert	Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann and Anna Lubiw
11:45-12:00	Peeling Digital Potatoes Loïc Crombez, Guilherme D. Da Fonseca and Yan Gerard	Rigid Graphs that are Movable Georg Grasegger, Jan Legerský and Josef Schicho
12:00-12:15	Consistent Digital Curved Rays Jinhee Chun, Kenya Kikuchi and Takeshi Tokuyama	Reliable Geometric Spanners Kevin Buchin, Sariel Har-Peled and Dániel Oláh
12:15-12:30	Fast-Forward 2

	Session 2A: Geometry Session chair: Anne Driemel	Session 2B: Kinetic Topology Session chair: Wouter Meulemans
14:00-14:15	Approximating Sweepwidth of Polygons with Holes Dorian Rudolph	On Plane Subgraphs of Complete Topological Drawings Alfredo García, Alexander Pilz and Javier Tejel
14:15-14:30	Skeleton-based decomposition of simple polygons Leonie Selbach, Maike Buchin and Axel Mosig	Numerical Algorithm for the Topology of Singular Plane Curves George Krait, Sylvain Lazard, Guillaume Moroz and Marc Pouget
14:30-14:45	Probabilistic smallest enclosing ball in high dimensions via subgradient sampling Amer Krivosija and Alexander Munteanu	Kinetic Volume-Based Persistence for 1D Terrains Tim Ophelders, Willem Sonke, Bettina Speckmann and Kevin Verbeek
14:45-15:00	Triangles in the colored Euclidean plane Daniel Perz and Oswin Aichholzer	Stability analysis of kinetic oriented bounding boxes Wouter Meulemans, Kevin Verbeek and Jules Wulms
15:00-15:15	A Note on Universal Point Sets for Planar Graphs Manfred Scheucher, Hendrik Schrezenmaier and Raphael Steiner	A Poisson sample of a smooth surface is a good sample Charles Duménil and Olivier Devillers
15:15-15:30	Fast-Forward 3

	Session 3A: Curved Graph Drawing Session chair: Alexander Pilz	Session 3B: Data Structures Session chair: Frank Staals
16:00-16:15	Simplification of Polyline Bundles Joachim Spoerhase, Sabine Storandt and Johannes Zink	Testing Transmission Graphs for Acyclicity Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty and Micha Sharir
16:15-16:30	Bundled Crossings Revisited Steven Chaplick, Thomas C. Van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky and Alexander Wolff	Dynamic Maintenance of the Lower Envelope of Pseudo-Lines Ravid Cohen, Dan Halperin, Wolfgang Mulzer and Pankaj Agarwal
16:30-16:45	Shooting Stars in Simple Drawings of $K_{m,n}$ Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber and Alexandra Weinberger	Computing alpha-Shapes for Temporal Range Queries on Point Sets Annika Bonerath, Jan-Henrik Haunert and Benjamin Niedermann
16:45-17:00	Extending Simple Drawings Alan Arroyo, Martin Derka and Irene Parada	Simplicial Depth for Multiple Query Points Luis Barba, Stefan Lochau, Alexander Pilz and Patrick Schnider
17:00-17:15	Computing Optimal Tangles Faster Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff and Johannes Zink	Encoding 3SUM Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin and Aurélien Ooms

17:30-18:45	Business Meeting

Tuesday, 19 March

9:15-10:15	Invited talk: Vera Sacristán Computational Geometry has a role to play in controlling modular robotic systems
10:15-10:30	Fast-Forward 4

	Session 4A: The Voronoï Session Session chair: Marc van Kreveld	Session 4B: Disk Graphs Session chair: Jan Kratochvil
11:00-11:15	A Wavefront-Like Strategy for Computing Multiplicatively Weighted Voronoi Diagrams Martin Held and Stefan de Lorenzo	Approximate strong edge-colouring of unit disk graphs Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang and François Pirot
11:15-11:30	Linear-size farthest color Voronoi diagrams: conditions and algorithms Ioannis Mantas, Evanthia Papadopoulou, Rodrigo I. Silveira and Vera Sacristán	Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard Man Kwun Chiu, Jonas Cleve and Martin Nöllenburg
11:30-11:45	Unbounded Regions of Higher-Order Line and Segment Voronoi Diagrams in Higher Dimensions Gill Barequet, Evanthia Papadopoulou and Martin Suderland	Simultaneous Representation of Proper and Unit Interval Graphs Ignaz Rutter, Darren Strash, Peter Stumpf and Michael Vollmer
11:45-12:00	Hamiltonicity for convex shape Delaunay and Gabriel graphs Prosenjit Bose, Pilar Cano, Maria Saumell and Rodrigo I. Silveira	Packing Disks into Disks with Optimal Worst-Case Density Sándor Fekete, Phillip Keldenich and Christian Scheffer
12:00-12:15	Delaunay triangulations of symmetric hyperbolic surfaces Matthijs Ebbens, Iordan Iordanov, Monique Teillaud and Gert Vegter	Dynamic Disk Connectivity Alexander Kauer and Wolfgang Mulzer

Wednesday, 20 March

9:15-10:15	Invited talk: Jeff Erickson Variations on a theme of Steinitz
10:15-10:30	Fast-Forward 5

	Session 5A: Trajectories Session chair: Rodrigo Silveira	Session 5B: Points that Matter Session chair: John Iacono
11:00-11:15	Distance Measures for Embedded Graphs - Revisited Hugo Akitaya, Maike Buchin and Bernhard Kilgus	Approximating the Earth Mover's Distance between a set of points and line segments Marc van Kreveld, Frank Staals, Amir Vaxman and Jordi L. Vermeulen
11:15-11:30	The k-Fréchet distance revisited and extended Leonie Ryvkin, Maike Buchin, Jérôme Urhausen and Hugo A. Akitaya	On Disjoint Holes in Point Sets Manfred Scheucher
11:30-11:45	Coresets for $(k,l)$-Clustering under the Fréchet Distance Dennis Rohde and Maike Buchin	3D Staged Tile Self-Assembly Arne Schmidt
11:45-12:00	On the hardness of finding an average curve Kevin Buchin, Anne Driemel and Martijn Struijs	O-Hull Formation for Programmable Matter Joshua Daymude, Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler and Andrea Richa
12:00-12:15	Maximum Physically Consistent Trajectories Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann and Frank Staals	Improved Time-Space Bounds for Grid Graph Reachability Rahul Jain and Raghunath Tewari
12:15-12:30	Fast-Forward 6

	Session 6A: Poly* Session chair: Heep-Kap Ahn	Session 6B: Colourful Games Session chair: Stefan Felsner
14:00-14:15	Algorithmic Enumeration of Surrounding Polygons Katsuhisa Yamanaka, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara and Tanami Yamauchi	Characterization and Computation of the Feasible Space of an Articulated Probe Ovidiu Daescu and Ka Yaw Teo Green-Wins Solitaire Revisited --- Simultaneous Flips that Affect Many Edges Michael Hoffmann, János Pach and Miloš Stojaković
14:15-14:30	A 1/4-approximation algorithm for the maximum hidden vertex set problem in simple polygons Carlos Alegría, Pritam Bhattacharya and Subir Kumar Ghosh On the complexity of nesting polytopes Michael Gene Dobbins, Andreas Holmsen and Tillmann Miltzow	Erdős-Szekeres-Type Games Oswin Aichholzer, José-Miguel Díaz-Báñez, Thomas Hackl, David Orden, Alexander Pilz, Inmaculada Ventura and Birgit Vogtenhuber
14:30-14:45	Recognizing Visibility Graphs of Polygons with Holes Hossein Boomari, Mojtaba Ostovari and Alireza Zarei Smoothed Analysis of the Art Gallery Problem Michael Dobbins, Andreas Holmsen and Tillmann Miltzow	Balanced Covering Problem in Bicolored point Sets Sujoy Bhore, Supantha Pandit and Sasanka Roy
14:45-15:00	Practical volume estimation by a new annealing schedule for cooling convex bodies Apostolos Chalkis, Ioannis Emiris and Vissarionas Fisikopoulos	On the 2-Colored Crossing Number Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo Toscano, Irene Parada, Birgit Vogtenhuber and Francisco Zaragoza
~~15:00-15:15~~
~~15:15-15:30~~
~~15:30-15:45~~ 15:00-15:15	Best Student Presentation Award Winner: Jonas Cleve