The list of papers accepted at EuroCG 2020 has been published, and
registration is now open. Early registration ends on February 27.
Accepted papers with abstracts:
http://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/index.php?id=accepted-papers
Registration:
http://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/index.php?id=registration
The 36th European Workshop on Computational Geometry (EuroCG 2020) will
be held March 16–18 (Mon–Wed), 2020 at the University of Würzburg in
Franconia (Germany). EuroCG is an annual workshop that combines a strong
scientific tradition with a friendly and informal atmosphere. The
workshop is a forum where established researchers and students can meet,
discuss their work, present their results, and establish scientific
collaborations. More information about the event can be found on the
following page.
http://go.uniwue.de/eurocg20
After the Workshop, a two-day PhD School (Thu+Fri, March 19+20) will be
held in the rooms of the Institute of Computer Science.
http://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/index.php?id=phd-school
We look forward to see you in Würzburg!
Steve Chaplick, Philipp Kindermann, and Alexander Wolff
on behalf of EuroCG 2020 Program Committee
===== ACCEPTED PAPERS FOR EUROCG 2020 =====
01. Expected Complexity of Routing in Theta6 and Half-Theta6 Graphs
Prosenjit Bose, Jean-Lou De Carufel and Olivier Devillers.
02. Quadrangulations of a polygon with spirality
Fumiya Hidaka, Naoki Matsumoto and Atsuhiro Nakamoto.
03. Fréchet Distance Between Uncertain Trajectories: Computing Expected
Value and Upper Bound
Kevin Buchin, Maarten Löffler, Aleksandr Popov and Marcel Roeloffzen.
04. Packing Squares into a Disk with Optimal Worst-Case Density
Sándor Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip
Keldenich, Linda Kleist and Christian Scheffer.
05. Worst-Case Optimal Covering of Rectangles by Disks
Sándor Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer
and Sahil Shah.
06. Connected Coordinated Motion Planning with Bounded Stretch
Sándor Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck and
Christian Scheffer.
07. Recognition and Reconfiguration of Lattice-Based Cellular Structures
by Simple Robots
Amira Abdel-Rahman, Aaron Becker, Daniel E. Biediger, Kenneth
Cheung, Sándor Fekete, Benjamin Jenett, Eike Niehs, Christian Scheffer,
Arne Schmidt and Mike Yanuzzi.
08. Targeted Drug Delivery: Advanced Algorithmic Methods for Collecting
a Swarm of Particles with Uniform, External Forces
Aaron Becker, Sándor Fekete, Li Huang, Phillip Keldenich, Linda
Kleist, Dominik Krupke, Christian Rieck and Arne Schmidt.
09. Coordinated Particle Relocation Using Finite Static Friction with
Boundary Walls
Victor Baez, Aaron Becker, Sándor Fekete and Arne Schmidt.
10. Probing a Set of Trajectories to Maximize Captured Movement
Sándor Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph
Mitchell, Ojas Parekh and Cynthia Phillips.
11. On the Average Complexity of the k-Level
Man Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider,
Raphael Steiner and Pavel Valtr.
12. Topological Drawings meet Classical Theorems from Convex Geometry
Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder
and Raphael Steiner.
13. The widest corridor through a simple polygon
David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia and Pawel
Zylinski.
14. Near-unit distance embedding of points in the plane and space.
Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama.
15. On Implementing Multiplicatively Weighted Voronoi Diagrams
Martin Held and Stefan de Lorenzo.
16. Sometimes Reliable Spanners of Almost Linear Size
Kevin Buchin, Sariel Har-Peled and Dániel Oláh.
17. A polynomial-time partitioning algorithm for weighted cactus graphs
Leonie Selbach and Maike Buchin.
18. Topologically correct PL-approximations of isomanifolds
Jean-Daniel Boissonnat and Mathijs Wintraecken.
19. Holes and islands in random point sets
Martin Balko, Manfred Scheucher and Pavel Valtr.
20. Computing Area-Optimal Simple Polygonalizations
Sándor Fekete, Andreas Haas, Phillip Keldenich, Michael Perk and
Arne Schmidt.
21. Weighted Epsilon-Nets
Daniel Bertschinger and Patrick Schnider.
22. Homotopic Curve Shortening and the Affine Curve-Shortening Flow
Sergey Avvakumov and Gabriel Nivasch.
23. Applications of Concatenation Arguments to Polyominoes and Polycubes
Gill Barequet, Gil Ben-Shachar and Martha Osegueda.
24. Scheduling drones to cover outdoor events
Oswin Aichholzer, Luis Evaristo Caraballo de La Cruz, José-Miguel
Díaz-Báñez, Ruy Fabila-Monroy, Irene Parada, Inmaculada Ventura and
Birgit Vogtenhuber.
25. Edge Guarding Plane Graphs
Paul Jungeblut and Torsten Ueckerdt.
26. Geometric bistellar moves relate triangulations of Euclidean,
hyperbolic and spherical manifolds
Tejas Kalelkar and Advait Phanse.
27. Efficiently stabbing convex polygons and variants of the
Hadwiger-Debrunner (p, q)-theorem
Justin Dallant and Patrick Schnider.
28. Weak Unit Disk Contact Representations for Graphs without Embedding
Jonas Cleve.
29. On Hard Instances of the Minimum-Weight Triangulation Problem
Sándor Fekete, Andreas Haas, Yannic Lieder, Eike Niehs, Michael
Perk, Victoria Sack and Christian Scheffer.
30. Flips in higher order Delaunay triangulations
Elena Arseneva, Prosenjit Bose, Pilar Cano and Rodrigo I Silveira.
31. Distance Measures for Embedded Graphs - Optimal Graph Mappings
Maike Buchin and Bernhard Kilgus.
32. Reconfiguring sliding squares in-place by flooding
Joel Moreno and Vera Sacristán.
33. Complexity of the Generalized Ham-Sandwich Problem
Man Kwun Chiu, Aruni Choudhary and Wolfgang Mulzer.
34. Graph Planarity Testing with Hierarchical Embedding Constraints
Giuseppe Liotta, Ignaz Rutter and Alessandra Tappini.
35. On the edge-length ratio of 2-trees
Václav Blažej, Jiří Fiala and Giuseppe Liotta.
36. Simple Drawings of Km,n Contain Shooting Stars
Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber
and Alexandra Weinberger.
37. On the Number of Delaunay Triangles occurring in all Contiguous
Subsequences
Stefan Funke and Felix Weitbrecht.
38. Empty Rainbow Triangles in k-colored Point Sets
Ruy Fabila-Monroy, Daniel Perz and Ana Laura Trujillo.
39. Bitonicity of Euclidean TSP in Narrow Strips
Henk Alkema, Mark de Berg and Sándor Kisfaludi-Bak.
40. Experimental Evaluation of Straight Skeleton Implementations Based
on Exact Arithmetic
Günther Eder, Martin Held and Peter Palfrader.
41. Finding an Induced Subtree in an Intersection Graph is often hard
Hidefumi Hiraishi, Dejun Mao and Patrick Schnider.
42. Scaling and compressing melodies using geometric similarity measures
Luis Evaristo Caraballo de La Cruz, José-Miguel Díaz-Báñez, Fabio
Rodríguez, Vanesa Sánchez-Canales and Inmaculada Ventura.
43. Rotational symmetric flexible placements of graphs
Sean Dewar, Georg Grasegger and Jan Legerský.
44. Augmenting Polygons with Matchings
Alexander Pilz, Jonathan Rollin, Lena Schlipf and André Schulz.
45. Covering a set of line segments with a few squares
Joachim Gudmundsson, Mees van de Kerkhof, Andre van Renssen, Frank
Staals, Lionov Wiratma and Sampson Wong.
46. Monotone Arc Diagrams with few Biarcs
Steven Chaplick, Henry Förster, Michael Hoffmann and Michael Kaufmann.
47. Colouring bottomless rectangles and arborescences
Domotor Palvolgyi and Narmada Varadarajan.
48. Maximum Rectilinear Crossing Number of Uniform Hypergraphs
Rahul Gangopadhyay and Saif Ayan Khan.
49. On Minimal-Perimeter Lattice Animals
Gill Barequet and Gil Ben-Shachar.
50. Shape Formation in a Three-dimensional Model for Hybrid Programmable
Matter
Kristian Hinnenthal, Dorian Rudolph and Christian Scheideler.
51. Smallest Universal Covers for Families of Triangles
Ji-won Park and Otfried Cheong.
52. Between Two Shapes, Using the Hausdorff Distance
Marc van Kreveld, Till Miltzow, Tim Ophelders, Willem Sonke and
Jordi Vermeulen.
53. Representing Graphs by Polygons with Edge Contacts in 3. Elena
Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz,
Birgit Vogtenhuber and Alexander Wolff.
54. Headerless Routing in Unit Disk Graphs
Wolfgang Mulzer and Max Willert.
55. A (1 + ε)-approximation for the minimum enclosing ball problem in R^d
Sang-Sub Kim and Barbara Schwarzwald.
56. Disjoint tree-compatible plane perfect matchings
Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz and Josef
Tkadlec.
57. Minimum Convex Partition of Degenerate Point Sets is NP-Hard
Nicolas Grelier.
58. Computing the Frechet distance of trees and graphs of bounded tree width
Maike Buchin, Amer Krivosija and Alexander Neuhaus.
59. On the complexity of the middle curve problem
Maike Buchin, Nicole Funk and Amer Krivosija.
60. Spanners for Transmission Graphs Using the Path-Greedy
Stav Ashur and Paz Carmi.
61. Diverse Voronoi Partitions of 1D Colored Points
Marc Van Kreveld, Bettina Speckmann and Jérôme Urhausen.
62. Smoothed Analysis of Resource Augmentation
Jeff Erickson, Ivor van der Hoog and Till Miltzow.
63. The Multivariate Schwartz-Zippel Lemma
Mahmut Levent Doğan, Alperen Ergur, Elias Tsigaridas and Jake D. Mundo.
64. Orthogonal Schematization with Minimum Homotopy Area
Bram Custers, Jeff Erickson, Irina Kostitsyna, Wouter Meulemans,
Bettina Speckmann and Kevin Verbeek.
65. Improved data structures for Frechét distance queries
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Rodrigo Silveira,
Lena Schlipf and Frank Staals.
66. Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li and
Martin Nöllenburg.
67. The Complexity of Finding Tangles
Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky,
Alexander Wolff and Johannes Zink.
68. Sparse Regression via Range Counting
Jean Cardinal and Aurélien Ooms.
69. The Very Best of Perfect Non-crossing Matchings
Ioannis Mantas, Marko Savić and Hendrik Schrezenmaier.
70. One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf
and Antonios Symvonis.
71. Labeling Nonograms
Maarten Löffler and Martin Nöllenburg.
72. Certified approximation algorithms for the Fermat point and k-ellipses
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin
Suderland and Chee Yap.
73. Repulsion region in a simple polygon
Arthur van Goethem, Irina Kostitsyna, Kevin Verbeek and Jules Wulms.
74. The angular blowing-a-kiss problem
Kevin Buchin, Irina Kostitsyna, Roel Lambers and Martijn Struijs.
75. On Generating Polygons: Introducing the Salzburg Database
Günther Eder, Martin Held, Steinþór Jasonarson, Philipp Mayer and
Peter Palfrader.
76. Local Routing in a Tree Metric 1-Spanner
Milutin Brankovic, Joachim Gudmundsson and André van Renssen.
77. A better approximation for longest noncrossing spanning trees
Sergio Cabello, Aruni Choudhary, Michael Hoffmann, Katharina Klost,
Meghana M. Reddy, Wolfgang Mulzer, Felix Schröder and Josef Tkadlec.
78. The Tree Stabbing Number is not Monotone
Johannes Obenaus and Wolfgang Mulzer.
79. On the maximum number of crossings in star-simple drawings of Kn
with no empty lens
Stefan Felsner, Michael Hoffmann, Kristin Knorr and Irene Parada.
80. Simple Topological Drawings of k-Planar Graphs
Chih-Hung Liu, Csaba D Toth and Meghana M. Reddy.
81. Enumerating isotopy classes of tilings of triply-periodic minimal
surfaces
Benedikt Kolbe and Myfanwy Evans.
82. Computing the cut distance of two curves
Maike Buchin, Leonie Ryvkin and Jerome Urhausen.
83. Tight Rectilinear Hulls of Simple Polygons
Annika Bonerath, Jan-Henrik Haunert and Benjamin Niedermann.
84. Approximating the Packing of Unit Disks into Simple Containers
Helmut Alt and Nadja Seiferth.
85. Improved constant factor for the unit distance problem
Péter Ágoston and Dömötör Pálvölgyi.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
