The SoCG-logo for 2022

CG:YRF 2022

7–10 June 2022 in Berlin, Germany

The SoCG-logo
Booklet of Abstracts
The CG:YRF 2022 booklet of abstracts of now available for download.
Call for Papers: Computational Geometry: Young Researchers Forum (CG:YRF)

The 38th International Symposium on Computational Geometry (SoCG 2022) is planned to take place in Berlin, Germany, June 07–10, 2022. It brings together the global community of researchers who work on a large variety of aspects that combine geometry, algorithms and applications. To allow a broad audience to actively participate in the community's major scientific event, this year SoCG will again be accompanied by a series of satellite events, which together constitute "CG Week 2022".

One of these satellite events will be the "Computational Geometry: Young Researchers Forum" (CG:YRF), which is aimed at current and recent students. The active involvement by students and recent graduates in research, discussions, and social events has been longstanding tradition in the CG community. Participation in a top-level event such as SoCG can be educating, motivating, and useful for networking, both with other students and with more senior scientists.

The YRF presents young researchers (defined as not having received a formal doctorate before January 1, 2020) an opportunity to present their work (in progress as well as finished results) to the CG community in a friendly, open setting. Just like in the main event, presentations will be given in the form of talks. A pre-screening (but no formal review process) will ensure appropriate quality control.

Important Dates
Early Submission Option:
Program Committee
Submit via the EasyChair Link

Submission guidelines

The idea of the event is for young researchers to present new and ongoing work. Therefore, the work should not have appeared in print in a formally reviewed proceedings volume or journal by the time of submission deadline, and at least one author must be a young researcher.

Topics must fit into the general context of SoCG, as described in the call for SoCG submissions.

Submissions must be formatted according to the same style file as regular SoCG submissions and not exceed 80 lines, excluding front matter, references. To ensure an accurate line counting, authors must use the LaTeX class file socg-lipics-v2021, which is a wrapper around the standard LIPIcs class. Authors should refrain from putting excessive amounts of texts in parts in which lines are not counted automatically.

Submissions can contain an appendix of arbitrary length to provide further details for the screening process, but the main body of the text should be understandable without reading the appendix. Appendices will also not be contained in the booklet (see below).

Accepted abstracts will be compiled in a booklet of abstracts that will be distributed among the participants; this should not be considered a formal publication. In particular, participants are encouraged to submit (an extended version of) their presented work to a conference with formal proceedings and/or to a journal. Booklets of abstracts from previous years' YRF are available on .

The work must be presented at CG:YRF by an author who is a young researcher. Otherwise, it will be removed from the program. Given the developing COVID-19 pandemic, the format of both attendance and presentation will be clarified closer to the event.

We will employ a two-phase screening process. After the first review phase, there will be a notification of either rejection (if the result is clearly out of scope, or technically incorrect), or conditional acceptance, accompanied with a description of required changes to be made (either with respect to content or format). In the second phase, we will check whether the changes have been implemented satisfactorily. The screening process is intended to ensure the technical quality of the presented work. Submissions that are not well-written risk rejection, irrespective of correctness. Authors are strongly encouraged to have their submissions proofread by their advisor or another experienced scientist.

Early Submission

Some young researchers need more time to arrange for travel, visas, or funding. For such cases, we have an early deadline for which there will be an early notification of conditional acceptance. All submissions will be judged according to the same standards of quality regardless of which submission date was used. The early submission date is before the SoCG notification date, and it is acceptable to have parallel submission of the same results; however, it will be expected that the YRF submission will be withdrawn if the full paper is accepted to SoCG. The reviewing for YRF is completely independent of the reviewing for SoCG.

List of Accepted Contributions
Authors Title
Daniel W. Cranston, Jiaxi Nie, Jacques Verstraete and Alexandra Wesolek On Asymptotic Packing of Geometric Graphs
Sarah Percival An Efficient Algorithm for the Computation of Reeb Spaces from Roadmaps
Reilly Browne and Eric Chiu Collapsing the Hidden-Set Convex-Cover Inequality
Tatyana Zaitseva Self-affine tilings, multivariate B-splines and subdivision schemes
Luis Crespo Ruiz and Francisco Santos The tropical variety of antisymmetric matrices
Sarita de Berg, Marc van Kreveld and Frank Staals The complexity of geodesic spanners
Matthijs Ebbens and Francis Lazarus Computing the length spectrum of combinatorial graphs on the torus
Vadim Lebovici Euler-Fourier transform of constructible functions
Guillermo Esteban, Prosenjit Bose, David Orden and Rodrigo Silveira On approximating shortest paths in weighted hexagonal tessellations
Wojciech Chachólski, René Corbet and Anna-Laura Sattelberger The Shift-Dimension of Multipersistence Modules
Alejandro Flores-Velazco Improved Search of Relevant Points for Nearest-Neighbor Classification
Kristóf Huszár and Jonathan Spreer On the Width of Complicated JSJ Decompositions
Benjamin Brück and Adélie Garin Stratifying the space of barcodes using Coxeter complexes
Hana Dal Poz Kourimska and Mathijs Wintraecken Stability of circumcentres for small metric perturbations of spaces of constant curvature
Brendan Mallery, Adélie Garin and Justin Curry Lattice Theoretic Perspectives on the Persistence Map
Mara Belotti, Michael Joswig and Marta Panizzut Algebraic Degrees of 3-Dimensional Polytopes
Thijs van der Horst, Maarten Löffler and Frank Staals Chromatic k-Nearest Neighbor Queries
Florian Russold Persistent sheaf cohomology
Reza Bigdeli and Anna Lubiw Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph
Manuel Radons Edge-unfolding nested prismatoids
Oliver Chubet A Maximum Subbarcode Matching Algorithm
Ángel Javier Alonso, Michael Kerber and Siddharth Pritam Reducing Multi-Parameter Flag Filtrations via Edge Collapses
Erin Chambers, Kathleen Kramer and David Letscher The Edit Distance for Smoothings of Reeb Graphs
Tzvika Geft, Yonatan Nakar and Dan Halperin Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration
Benjamin Holmgren, Sushovan Majhi, Brittany Terese Fasy, Erin Chambers and Carola Wenk Path-Connectivity of Fréchet Spaces of Graphs
Abhishek Rathod, Barbara Giunti, Ulrich Bauer, Michael Kerber, Talha Bin Masood and Guillaume Houry Sparsity and output-sensitivity in persistence computation
David Loiseaux, Mathieu Carrière and Andrew Blumberg An Approximation of Multiparameter Persistence Modules