The 40th International Symposium on Computational Geometry (SoCG 2024) is planned to be held in Athens, Greece, June 11–14 2024, as part of the Computational Geometry (CG) Week. We invite high quality submissions that describe original research on computational problems in a geometric and/or topological setting. Topics of interest include, but are not limited to:
SoCG is dedicated to providing an environment that is free from harassment, bullying, discrimination, and retaliation for all participants. All attendees, speakers, sponsors, and volunteers at our conference are required to agree with the CG Week code of conduct.
A person found in violation of these standards can be barred from attendance. This includes violations and sanctions that were established by other academic or professional institutions as the outcome of a formal enquiry.
If an author has a conflict of such nature with a potential reviewer, and the author has sufficient grounds to believe that the review would be negatively biased, then the author is asked to declare this conflict in HotCRP. You are also welcome to contact a SoCG SafeTOC advocate who will treat any supporting information confidentially. For a list of SoCG advocates with contact information, please refer to CG Week Code of Conduct.
When writing or evaluating a SoCG paper, it is important to keep in mind that there are different types of contributions, each with its own strengths. To ensure that a submission is evaluated on its own merits, authors will need to identify the main strengths of their submission, as captured by four possible paper types. PC members and external reviewers will be asked to take into account these paper types together with their associated evaluation criteria when they evaluate a paper. There are no quotas for the paper types and submissions can be labeled with more than one paper type at the time of submission.
This year's SoCG will employ a lightweight double-blind reviewing process, and will allow PC members (other than the PC chairs) to submit to the conference as well. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). Particular care needs to be taken if there is any accompanying software or data, which needs to be linked anonymously (for example, via a DropBox folder or GitHub, perhaps with a subset of synthetic data if the real data is not anonymized). Upon registering a submission, the authors will declare conflicts of interest with PC members, as well as listing email address or domain level conflicts (i.e. “Jeff M. Phillips (University of Utah)”, “All (Freie Universität Berlin)”) of other professional or personal conflicts. The purpose of lightweight double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. We encourage authors with further questions on double-blind reviewing to contact the PC chairs, or to see the more detailed discussion in the proposal that preceded the vote to move to double blind.
Submissions must be formatted in accordance with the LIPIcs proceedings guidelines. Authors must use the LaTeX class file socg-lipics-v2021.cls (use the one updated in 2022; version 0.9), which is a wrapper around the standard LIPIcs class. The LIPIcs style and instructions are available here; the socg-lipics-v2021.cls class file is available here, and instructions on how to use it are available here. Submissions must not exceed 500 lines, excluding front matter (title, authors, and affiliations), references, and a clearly marked appendix (further described below), but including all other lines (in abstract, algorithms, tables, captions, etc.). The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors to not exceed 500 lines even if some lines are not counted automatically.
Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, each author's name and affiliation, as well as a short abstract. This should be followed by the main body of the paper that begins with a precise statement of the problem considered, a succinct summary of the results obtained (emphasizing the significance, novelty, and potential impact of the research), and a clear comparison with related work. The remainder of the extended abstract should provide sufficient details to allow the program committee to evaluate the validity, quality, and relevance of the contribution. Clarity of presentation is very important; the entire extended abstract should be written carefully, taking into consideration that it will be read and evaluated by both experts and non-experts, often under tight time constraints.
All details needed to verify the results must be provided. Supporting materials, including proofs of theoretical claims and experimental details, that do not fit in the 500-line limit should be given in an appendix. If more appropriate, the full version may be given as the appendix. In both cases, however, the authors should include in the main part specific pointers to the relevant locations in the appendix. The appendix will be read by the program committee members and subreviewers at their discretion and will not be published as part of the proceedings. Thus, the paper without the appendix should be able to stand on its own. Experimental and implementation results (independent of paper type) must be reproducible and verifiable. Authors of all types of papers are encouraged to put accompanying software and relevant data, if there are any, in a repository accessible to the reviewers. Authors are asked to indicate which of the supporting materials will remain publicly available if their papers are accepted.
Results previously published or accepted for publication in the proceedings of another conference cannot be submitted. Simultaneous submissions of the results to another conference with published proceedings are not allowed. Exempted are workshops and conferences without formal proceedings, but possibly with handouts containing short abstracts. In particular, submissions of papers that have appeared or will be submitted to EuroCG are allowed, since EuroCG does not publish formal proceedings, while submissions of papers that have appeared in CCCG are not allowed. Results that have already been accepted (with or without revision) for publication in a journal at the time of their submission to the symposium are not allowed.
Submissions deviating from the above guidelines risk being rejected without further consideration.
The guidelines are available here.
An author of each accepted paper will be expected to attend the symposium and present the paper (approximately 20 minutes). The format of both attendance and presentation will be clarified closer to the event. Awards will be given for the best paper and for the best student presentation. Authors of a selection of papers from the symposium will be invited to submit extended versions of their papers to special issues of Discrete & Computational Geometry and Journal of Computational Geometry. As in the previous years, the authors of the best paper will be invited to submit an extended version of their paper to the Journal of the ACM.
Final proceedings versions of accepted papers must respect the same formatting constraints as the submissions (LIPIcs proceedings format with socg-lipics-v2021; 500-line limit, excluding front matter and references), but must not comprise any appendix. If any supporting material (including complete proofs of theoretical claims and experimental details) does not fit in the specified limit, then the full version of the paper containing this information must be referenced in the conference version and made available at a public repository, such as arXiv, by the time the final version is submitted. Where applicable, we encourage the authors to make accompanying software and/or data publicly accessible, with proper references in the paper.
Title | Authors | |
---|---|---|
1 | An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching | Sayan Bandyapadhyay and Jie Xue |
2 | Topological k-metrics | Willow Barkan, Huck Bennett, and Amir Nayyeri |
3 | Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets | Tim Planken and Torsten Ueckerdt |
4 | Beyond chromatic threshold via $(p,q)$-theorem, and blow-up phenomenon | Hong Liu, Chong Shangguan, Jozef Skokan, and Zixiang Xu |
5 | Map-Matching Queries Under Fréchet Distance on Low-Density Spanners | Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, and Sampson Wong |
6 | Discrete Fréchet Distance Oracles | Boris Aronov, Tsuri Farhana, Matthew J. Katz, and Indu Ramesh |
7 | Fast approximations and coresets for $(k,\ell)$-median under dynamic time warping | Jacobus Conradi, Benedikt Kolbe, Ioannis Psarros, and Dennis Rohde |
8 | A GPU algorithm for enumerating seed PL-spheres of Picard number 4 whose facets are bases of a binary matroid and application to toric topology | Suyoung Choi, Hyeontae Jang, and Mathieu Vallée |
9 | Totally geodesic surfaces in hyperbolic 3-manifolds: algorithms and examples | Brannon Basilio, Chaeryn Lee, and Joseph Malionek |
10 | Effective Computation of the Heegaard Genus of 3-Manifolds | Benjamin A. Burton and Finn Thompson |
11 | Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect | Pierre Dehornoy, Corentin Lunel, and Arnaud de Mesmay |
12 | Pach's animal problem within the bounding box | Martin Tancer |
13 | Reconfiguration of plane trees in convex geometric graphs | Nicolas Bousquet, Lucas De Meyer, Théo Pierron, and Alexandra Wesolek |
14 | On the Parameterized Complexity of Motion Planning for Rectangular Robots | Iyad Kanj and Salman Parsa |
15 | A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in Quadratic Time | Zachary Abel, Hugo Akitaya, Scott Kominers, Matias Korman, and Frederick Stock |
16 | Almost Optimal Locality Sensitive Orderings in Euclidean Space | Zhimeng Gao and Sariel Har-Peled |
17 | A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space | Sándor Kisfaludi-Bak and Geert van Wordragen |
18 | Optimal Euclidean Tree Covers | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, and Cuong Than |
19 | Discrepancy of halfplanes | Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen |
20 | A Canonical Tree Decomposition for Chirotopes | Mathilde Bouvel, Valentin Feray, Xavier Goaoc, and Florent Koechlin |
21 | Saturation results around the Erdős-Szekeres problem | Gábor Damásdi, Zichao Dong, Manfred Scheucher, and Ji Zeng |
22 | A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$ | Boris Aronov, Mark de Berg, and Leonidas Theocharous |
23 | ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs | Shinwoo An and Eunjin Oh |
24 | Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs | Hsien-Chih Chang, Jie Gao, and Hung Le |
25 | Stability and Approximations for Decorated Reeb Spaces | Justin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, and Florian Russold |
26 | Strange Random Topology of the Circle | Uzu Lim |
27 | On Edge Collapse of Random Simplicial Complexes | Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, and Siddharth Pritam |
28 | Moderate Dimension Reduction for $k$-Center Clustering | Shaofeng H.-C. Jiang, Robert Krauthgamer, and Shay Sapir |
29 | Dimensionality of Hamming metrics and Rademacher type | Alexandros Eskenazis |
30 | Space Complexity of Euclidean Clustering | Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, and Zengfeng Huang |
31 | Clustering with Few Disks to Minimize the Sum of Radii | Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, and Leonidas Theocharous |
32 | An Improved Lower Bound on the Number of Pseudoline Arrangements [merged] | Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, and Manfred Scheucher |
33 | On the number of digons in arrangements of pairwise intersecting circles | Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Blanka Raffay |
34 | A structure theorem for pseudo-segments and its applications | Jacob Fox, Janos Pach, and Andrew Suk |
35 | Sweeping Arrangements of Non-Piercing Curves in Plane | Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, and Saurabh Ray |
36 | Dynamic Convex Hulls for Simple Paths | Bruce Brewer, Gerth Stølting Brodal, and Haitao Wang |
37 | Optimal Algorithm for the Planar Two-Center Problem | Kyungjin Cho, Eunjin Oh, Haitao Wang, and Jie Xue |
38 | Geometric matching and bottleneck problems | Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, and Christian Knauer |
39 | Convex Polygon Containment: Improving Quadratic to Near Linear Time | Timothy M. Chan and Isaac M. Hair |
40 | Computing shortest closed curves on non-orientable surfaces | Denys Bulavka, Éric Colin de Verdière, and Niloufar Fuladi |
41 | Cup Product Persistence and Its Efficient Computation | Tamal K. Dey and Abhishek Rathod |
42 | Efficient Algorithms for Complexes of Persistence Modules with Applications | Tamal K. Dey, Florian Russold, and Shreyas N. Samaga |
43 | Computing Zigzag Vineyard Efficiently Including Expansions and Contractions | Tamal K. Dey and Tao Hou |
44 | Fréchet Edit Distance | Emily Fox, Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel |
45 | Fine-Grained Complexity of Earth Mover's Distance under Translation | Karl Bringmann, Frank Staals, Karol Wegrzycki, and Geert van Wordragen |
46 | Faster Fréchet Distance Approximation through Truncated Smoothing | Thijs van der Horst and Tim Ophelders |
47 | Morse Theory for the k-NN Distance Function | Yohai Reani and Omer Bobrowski |
48 | Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size | Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong |
49 | Light, Reliable Spanners | Arnold Filtser, Yuval Gitlitz, and Ofer Neiman |
50 | Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain | Sarita de Berg, Till Miltzow, and Frank Staals |
51 | A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon | Mark de Berg and Leonidas Theocharous |
52 | Robustly Guarding Polygons | Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph Mitchell |
53 | Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions | Fabrizio Grandoni, Edin Husić, Mathieu Mari, and Antoine Tinguely |
54 | Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane | Timothy M. Chan, Pingan Cheng, and Da Wei Zheng |
55 | Off-line Semi-Algebraic Range Searching in the Plane | Pankaj K Agarwal, Esther Ezra, and Micha Sharir |
56 | An improved bound on sums of square roots via the subspace theorem | Friedrich Eisenbrand, Matthieu Haeberle, and Neta Singer |
57 | A Topological Version of Schaefer’s Dichotomy Theorem | Patrick Schnider and Simon Weber |
58 | Approximating the geometric knapsack problem in near-linear time and dynamically | Moritz Buchem, Paul Deuker, and Andreas Wiese |
59 | Faster Approximation Scheme for Euclidean $k$-TSP | Ernest van Wijland and Hang Zhou |
60 | Plane Hamiltonian cycles in convex drawings | Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, and Manfred Scheucher |
61 | Constrained and Ordered Level Planarity Parameterized by the Number of Levels | Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink |
62 | 8-Partitioning Points in 3D, and Efficiently Too | Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner |
63 | Grid Peeling of Parabolas | Günter Rote, Moritz Rüber, and Morteza Saghafian |
64 | Nearly Orthogonal Sets over Finite Fields | Dror Chawin and Ishay Haviv |
65 | Colorful intersections and Tverberg partitions | Michael Gene Dobbins, Andreas F. Holmsen, and Dohyeon Lee |
66 | Dynamic Geometric Connectivity in the Plane with Constant Query Time | Timothy M. Chan and Zhengcheng Huang |
67 | Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time | Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms |
68 | Zarankiewicz's Problem via $\epsilon$-t-Nets | Chaya Keller and Shakhar Smorodinsky |
69 | Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals | Ángel Javier Alonso, Michael Kerber, and Primoz Skraba |
70 | Measure Theoretic Reeb Graphs and Reeb Spaces | Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, and Bei Wang |
71 | Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds | Dominique Attali, Hana Dal Poz Kourimska, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken |
72 | Separator Theorem and Algorithms for Planar Hyperbolic Graphs | Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, and Karol Węgrzycki |
73 | A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi |
74 | Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern | Jacob Focke, Florian Hoersch, Shaohua Li, and Dániel Marx |
75 | Demystifying Latschev's Theorem: Manifold Reconstruction from Noisy Data | Sushovan Majhi |
76 | Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory | Ulrich Bauer and Fabian Roll |
77 | The medial axis of closed bounded sets is Lipschitz stable with respect to the Hausdorff distance under ambient diffeomorphisms | Hana Dal Poz Kourimska, André Lieutier, and Mathijs Wintraecken |
78 | Practical Software for Triangulating and Simplifying 4-Manifolds | Rhuaidi Burke |
79 | Algorithms for Halfplane Coverage and Related Problems | Haitao Wang and Jie Xue |
80 | Enclosing Points with Geometric Objects | Timothy Chan, Qizheng He, and Jie Xue |
81 | SCARST: Schnyder Compact And Regularity Sensitive Triangulation Data Structure | Luca Castelli Aleardi and Olivier Devillers |
82 | Maximum Betti Numbers of Čech Complexes | Herbert Edelsbrunner and Janos Pach |