EuroCG 2019 Banner
1Algorithmic Enumeration of Surrounding Polygons
Katsuhisa Yamanaka, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara and Tanami Yamauchi
2A 1/4-Approximation Algorithm for the Maximum Hidden Vertex Set Problem in Simple Polygons
Carlos Alegría, Pritam Bhattacharya and Subir Kumar Ghosh
3Skeleton-based decomposition of simple polygons
Leonie Selbach, Maike Buchin and Axel Mosig
4Recognizing Visibility Graphs of Polygons with Holes
Hossein Boomari, Mojtaba Ostovari and Alireza Zarei
5Approximating Sweepwidth of Complex Polygons
Dorian Rudolph
6Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
Amer Krivosija and Alexander Munteanu
7Practical volume estimation by a new annealing schedule for cooling convex bodies
Apostolos Chalkis, Ioannis Emiris and Vissarionas Fisikopoulos
8On the complexity of nesting polytopes
Michael Gene Dobbins, Andreas Holmsen and Tillmann Miltzow
9Green-Wins Solitaire Revisited --- Simultaneous Flips that Affect Many Edges
Michael Hoffmann, János Pach and Miloš Stojaković
10Triangles in the colored Euclidean plane
Daniel Perz and Oswin Aichholzer
11A Wavefront-Like Strategy for Computing Multiplicatively Weighted Voronoi Diagrams
Martin Held and Stefan de Lorenzo
12Linear-size farthest color Voronoi diagrams: conditions and algorithms
Ioannis Mantas, Evanthia Papadopoulou, Rodrigo I. Silveira and Vera Sacristán
13Unbounded Regions of Higher-Order Line and Segment Voronoi Diagrams in Higher Dimensions
Gill Barequet, Evanthia Papadopoulou and Martin Suderland
14Hamiltonicity for convex shape Delaunay and Gabriel graphs
Prosenjit Bose, Pilar Cano, Maria Saumell and Rodrigo I. Silveira
15Delaunay triangulations of symmetric hyperbolic surfaces
Matthijs Ebbens, Iordan Iordanov, Monique Teillaud and Gert Vegter
16Computing the Straight Skeleton of a Rectilinear Monotone Polygon in Linear Time
Günther Eder, Martin Held and Peter Palfrader
17Maximum Rectilinear Convex Subsets
Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel and Jorge Urrutia
18Routing in Histograms
Man Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen and Max Willert
19Peeling Digital Potatoes
Loic Crombez, Guilherme D. Da Fonseca and Yan Gerard
20Consistent Digital Curved Rays
Jinhee Chun, Kenya Kikuchi and Takeshi Tokuyama
21A Note on Universal Point Sets for Planar Graphs
Manfred Scheucher, Hendrik Schrezenmaier and Raphael Steiner
22On Disjoint Holes in Point Sets
Manfred Scheucher
23Erdős-Szekeres-Type Games
Oswin Aichholzer, José-Miguel Díaz-Báñez, Thomas Hackl, David Orden, Alexander Pilz, Inmaculada Ventura and Birgit Vogtenhuber
24Approximating the Earth Mover's Distance between a set of points and line segments
Marc van Kreveld, Frank Staals, Amir Vaxman and Jordi L. Vermeulen
25Balanced Covering Problem in Bicolored point Sets
Sujoy Bhore, Supantha Pandit and Sasanka Roy
26Testing Transmission Graphs for Acyclicity
Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty and Micha Sharir
27Dynamic Maintenance of the Lower Envelope of Pseudo-Lines
Ravid Cohen, Dan Halperin, Wolfgang Mulzer and Pankaj Agarwal
28Computing alpha-Shapes for Temporal Range Queries on Point Sets
Annika Bonerath, Jan-Henrik Haunert and Benjamin Niedermann
29Simplicial Depth for Multiple Query Points
Luis Barba, Stefan Lochau, Alexander Pilz and Patrick Schnider
30Encoding 3SUM
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms and Pat Morin
313D Staged Tile Self-Assembly
Arne Schmidt
32O-Hull Formation for Programmable Matter
Joshua Daymude, Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler and Andrea Richa
33Characterization and Computation of the Feasible Space of an Articulated Probe
Ovidiu Daescu and Ka Yaw Teo
34Improved Time-Space Bounds for Grid Graph Reachability
Rahul Jain and Raghunath Tewari
35Smoothed Analysis of the Art Gallery Problem
Michael Dobbins, Andreas Holmsen and Tillmann Miltzow
36On Plane Subgraphs of Complete Topological Drawings
Alfredo García, Alexander Pilz and Javier Tejel
37Numerical Algorithm for the Topology of Singular Plane Curves
George Krait, Sylvain Lazard, Guillaume Moroz and Marc Pouget
38Kinetic Volume-Based Persistence for 1D Terrains
Tim Ophelders, Willem Sonke, Bettina Speckmann and Kevin Verbeek
39Stability analysis of kinetic oriented bounding boxes
Wouter Meulemans, Kevin Verbeek and Jules Wulms
40A Poisson sample of a smooth surface is a good sample
Charles Duménil and Olivier Devillers
41The k-Fréchet distance revisited and extended
Leonie Ryvkin, Maike Buchin, Jérôme Urhausen and Hugo A. Akitaya
42Coresets for $(k,l)$-Clustering under the Fréchet Distance
Dennis Rohde and Maike Buchin
43On the hardness of finding an average curve
Kevin Buchin, Anne Driemel and Martijn Struijs
44Maximum Physically Consistent Trajectories
Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann and Frank Staals
45Distance Measures for Embedded Graphs - Revisited
Hugo Akitaya, Maike Buchin and Bernhard Kilgus
46Approximate strong edge-colouring of unit disk graphs
Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang and François Pirot
47Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard
Man Kwun Chiu, Jonas Cleve and Martin Nöllenburg
48Simultaneous Representation of Proper and Unit Interval Graphs
Ignaz Rutter, Darren Strash, Peter Stumpf and Michael Vollmer
49Packing Disks into Disks with Optimal Worst-Case Density
Sándor Fekete, Phillip Keldenich and Christian Scheffer
50Dynamic Disk Connectivity
Alexander Kauer and Wolfgang Mulzer
51Terrain-Like and Non-Jumping Graphs
Stav Ashur, Omrit Filtser and Rachel Saban
52Recognizing Planar Laman Graphs
Jonathan Rollin, Lena Schlipf and André Schulz
53Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann and Anna Lubiw
54Rigid Graphs that are Movable
Georg Grasegger, Jan Legerský and Josef Schicho
55Reliable Geometric Spanners
Kevin Buchin, Sariel Har-Peled and Dániel Oláh
56On the 2-Colored Crossing Number
Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo Toscano, Irene Parada, Birgit Vogtenhuber and Francisco Zaragoza
57Bundled Crossings Revisited
Steven Chaplick, Thomas C. Van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky and Alexander Wolff
58Simplification of Polyline Bundles
Joachim Spoerhase, Sabine Storandt and Johannes Zink
59Shooting Stars in Simple Drawings of $K_{m,n}$
Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber and Alexandra Weinberger
60Extending Simple Drawings
Alan Arroyo, Martin Derka and Irene Parada
61Computing Optimal Tangles Faster
Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff and Johannes Zink