39th European Workshop on Computational Geometry
March 29-31 2023, Barcelona, Spain
https://dccg.upc.edu/eurocg23/
EuroCG 2023 will be held March 29-31, 2023 in Barcelona, Spain. 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.
================
Registration
================
Early Registration ends on *February 23, 2023*
See https://dccg.upc.edu/eurocg23/index.php/registration/ for more information.
================
Invited speakers
================
- Sergio Cabello (University of Ljubljana, Slovenia)
- Alberto Márquez (Universidad de Sevilla, Spain)
- Evanthia Papadopoulou (Università della Svizzera italiana, Switzerland)
================
Accepted papers
================
- Anna Brötzner and Oswin Aichholzer. Two Equivalent Representations
of Bicolored Order Types
- Helena Bergold, Stefan Felsner, Meghana M. Reddy and Manfred
Scheucher. Using SAT to study plane substructures in simple drawings
- Jan Kynčl and Jan Soukup. Many views of planar point sets
- Lucas Meijer and Till Miltzow. Sometimes Two Irrational Guards are Needed
- Patrick Schnider and Simon Weber. On the Complexity of Recognizing
Nerves of Convex Sets
- Tsuri Farhana and Matthew Katz. Spanners under the Hausdorff and
Fr{\'e}chet Distances
- Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher and
Birgit Vogtenhuber. Flip Graphs for Arrangements of Pseudocircles
- Frederik Brüning, Anne Driemel, Alperen Ergür and Heiko Röglin. On
the number of iterations of the DBA algorithm
- Michaela Borzechowski and Simon Weber. On Degeneracy in the
P-Matroid Oriented Matroid Complementarity Problem
- Helena Bergold, Manfred Scheucher and Felix Schröder. Holes in convex drawings
- Honglin Zhu and Hyuk Jun Kweon. Maximum overlap area of a convex
polyhedron and a convex polygon under translation
- Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani
and Martin Nöllenburg. Extending Orthogonal Planar Graph Drawings is
Fixed-Parameter Tractable
- Jacobus Conradi, Anne Driemel and Benedikt Kolbe. $(1+\eps)$-ANN
data structure for curves via subspaces of bounded doubling dimension
- Mark de Berg and Geert van Wordragen. Improved Bounds for Discrete
Voronoi Games
- Merce Claverol, Andrea de Las Heras Parrilla, David Flores Peñaloza,
Clemens Huemer and David Orden. On polynomials associated to Voronoi
diagrams of point sets and crossing numbers
- Max van Mulken, Bettina Speckmann and Kevin Verbeek. Density
Approximation for Kinetic Groups
- Fabian Klute and Marc van Kreveld. On the Size of Fully Diverse Sets
of Polygons using the Earth Movers Distance or Wasserstein Distance
- Camille Lanuel, Francis Lazarus and Rudi Pendavingh. A linear bound
for the Colin de Verdière parameter $\mu$ for graphs embedded on
surfaces
- Mónica Reyes, Cristina Dalfó, Miquel Angel Fiol and Arnau Messegué.
On the algebraic connectivity of token graphs of a cycle
- Henk Alkema and Mark de Berg. Euclidean One-of-a-Set TSP
- Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán and
Rodrigo Silveira. Shortest coordinated motion for a pair of square
robots
- Simon D. Fink and Ignaz Rutter. Maintaining Triconnected Components
under Node Expansion
- Sarita de Berg, Frank Staals and Tillmann Miltzow. Towards Space
Efficient Two-Point Shortest Path Queries in a Polygonal Domain
- Attila Jung. Radon number of graph families
- Julian Pfeifle. Proving non-realizability with grass-plucker3
- Rahul Jain, Marco Ricci, Jonathan Rollin and André Schulz. On the
geometric thickness of 2-degenerate graphs
- Luis Crespo Ruiz and Francisco Santos. Realizations of
multiassociahedra via rigidity
- Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher and
Birgit Vogtenhuber. Perfect Bichromatic Matchings with Crossings
- Patrizio Angelini, Michael Bekos, Julia Katheder, Michael Kaufmann
and Maximilian Pfister. Axis-Parallel Right Angle Crossing Graphs
- Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Michael Kaufmann
and Alessandra Tappini. k-planar Placement and Packing of
\Delta-regular Caterpillars
- Mark de Berg, Leyla Biabani, Morteza Monemizadeh and Leonidas
Theocharous. Clustering with Obstacles
- Mart Hagedoorn and Valentin Polishchuck. 2-point link distance
queries in polygonal domains
- Oswin Aichholzer, Joachim Orthaber and Birgit Vogtenhuber.
Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
- Meghana M. Reddy, Michael Hoffmann and Emanuel Seemann. Hamiltonian
Cycles and Matchings in 1-planar Graphs
- Nicholas Bieker, Thomas Bläsius, Emil Dohse and Paul Jungeblut.
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ER-Complete
- Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs
Villedieu and Jules Wulms. Crossing Minimization in Time Interval
Storylines
- Jean Cardinal. The Complexity of Intersection Graphs of Lines in
Space and Circle Orders
- Felix Weitbrecht. Interactive Exploration of the Temporal α-Shape
- Felix Weitbrecht. On the number of Delaunay Simplices over all Time
Window in any Dimension
- Herman Haverkort. Vorosketch and the L0 distance
- Signe Lundqvist, Klara Stokes and Lars-Daniel Öhman. Applying The
Pebble Game Algorithm to Rod Configurations
- Michael Hoffmann and Meghana M. Reddy. The Number of Edges in
Maximal 2-planar Graphs
- Jakob Baumann, Matthias Pfretzschner and Ignaz Rutter. Parameterized
Complexity of Vertex Splitting to Pathwidth at most 1
- Sándor Fekete, Dominik Krupke, Michael Perk, Christian Rieck and
Christian Scheffer. Circling a Square: The Lawn Mowing Problem Is
Algebraically Hard
- Giuseppe Liotta, Maarten Löffler, Fabrizio Montecchiani, Alessandra
Tappini and Soeren Terziadis. The Witness Unit Disk Representability
Problem
- Thijs van der Horst, Tim Ophelders and Bart van der Steenhoven.
Simply Realising an Imprecise Polyline is NP-hard
- Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Carolin Rehs, André
van Renssen and Sampson Wong. Oriented Spanners
- Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer and
Liam Roditty. Insertion-Only Dynamic Connectivity in General Disk
Graphs
- Freija van Lent, Julian Golak, Alexander Grigoriev and Aida Abiad.
An s-t Jordan curve crossing boundaries of a set of disk-homeomorphic
objects in the plane
- Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister
and Johannes Zink. Simultaneous Drawing of Layered Trees
- Erwin Glazenburg, Frank Staals and Marc van Kreveld. Classification
of 2D bichromatic points with outliers
- Stefan Funke and Sabine Storandt. Gradual Simplification of Polylines
- Panos Giannopoulos and Sergio Cabello. The Fréchet mean in the
space of segments
- Jiaxi Zhang and Ezra Miller. Geodesic complexity of convex polyhedra
- Michal Opler, Pavel Valtr and Tung Anh Vu. On the Arrangement of
Hyperplanes Determined by n Points
- Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov and
Sampson Wong. Map Matching Queries Under Fréchet Distance on
Low-Density Spanners
- Ignaz Rutter and Peter Stumpf. Simultaneous Representation of
Interval Graphs in the Sunflower Case
- J. Andreas Bærentzen, Rasmus E. Christensen, Emil Toftegaard Gæde
and Eva Rotenberg. On Computing Local Separators for Skeletonization
- Minh Tuan Ha, Paul Jungeblut and Torsten Ueckerdt. Primal-Dual Cops and Robber
- Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann
Miltzow and Simon Weber. The Complexity of Recognizing Geometric
Hypergraphs
- Peyman Afshani and Aniket Basu Roy. Packing Fréchet Balls
- Ondřej Chwiedziuk, Barbora Dohnalová and Miroslav Horský. Non-convex
position of lines in R3
- Thijs van der Horst and Tim Ophelders. Computing Minimum Complexity
1D Curve Simplifications under the Fréchet Distance
- Vahideh Keikha. A Heuristic Algorithm for Maximal Contained Polyhedrons
- Patricia Bachmann and Ignaz Rutter. Crossing Optimization in
Neighborhood Drawings
================
Organizing Committee
================
Andrea de las Heras (U. Politècnica de Catalunya)
Guillermo Esteban (U. de Alcalá & Carleton U.)
Delia Garijo (U. de Sevilla)
Clemens Huemer (U. Politècnica de Catalunya)
Fabian Klute (U. Politècnica de Catalunya)
Mercè Mora (U. Politècnica de Catalunya)
Nicolau Oliver Burwitz (U. Politècnica de Catalunya)
David Orden (U. de Alcalá)
Irene Parada (Utrecht U.)
Carlos Seara (U. Politècnica de Catalunya)
Rodrigo Silveira (U. Politècnica de Catalunya), CHAIR
Looking forward to seeing you in Barcelona!
The organizers
**********************************************************
*
* 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
