Hung Le, Shay Solomon, Cuong Than, Csaba D. T\'oth, Tianyi Zhang: Improved Euclidean Shallow Light Trees https://arxiv.org/abs/2608.03951 https://arxiv.org/pdf/2608.03951 https://arxiv.org/html/2608.03951

Tamal K. Dey, Gilberto Gonzalez-Arroyo, Tao Hou: Linked Barcode for Persistence Induced by Filtrations https://arxiv.org/abs/2608.03765 https://arxiv.org/pdf/2608.03765 https://arxiv.org/html/2608.03765

[2026-08-05 Wed (UTC), 2 new articles found for csCG Computational Geometry]

Shimin Li: Algorithms for Connectivity Maintenance and Barrier Coverage on a Closed Cycle https://arxiv.org/abs/2608.01307 https://arxiv.org/pdf/2608.01307 https://arxiv.org/html/2608.01307

Eungyu Woo, Donghoon Shin: Exact Algorithms for Minimum Steiner Point Trees https://arxiv.org/abs/2608.00795 https://arxiv.org/pdf/2608.00795 https://arxiv.org/html/2608.00795

[2026-08-04 Tue (UTC), 2 new articles found for csCG Computational Geometry]

Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi: Approximation Algorithms for Geometric Maximum Coverage https://arxiv.org/abs/2607.29160 https://arxiv.org/pdf/2607.29160 https://arxiv.org/html/2607.29160

Ahmed Abdelkader, David M. Mount: Differentiable Approximations for Distance Queries https://arxiv.org/abs/2607.28886 https://arxiv.org/pdf/2607.28886 https://arxiv.org/html/2607.28886

Ahmed Abdelkader, David M. Mount: Convex Approximation and the Hilbert Geometry https://arxiv.org/abs/2607.28885 https://arxiv.org/pdf/2607.28885 https://arxiv.org/html/2607.28885

Maurizio Falconi: Arranging circles of radii 1,2,...,n around a central circle: a Supnick TSP and certified finite optima https://arxiv.org/abs/2607.28654 https://arxiv.org/pdf/2607.28654 https://arxiv.org/html/2607.28654

[2026-08-03 Mon (UTC), 4 new articles found for csCG Computational Geometry]

Khaled Elbassioni, Rishikesh Gajjala, Saurabh Ray: Tight UGC Thresholds for Geometric Stabbing Problems https://arxiv.org/abs/2607.28062 https://arxiv.org/pdf/2607.28062 https://arxiv.org/html/2607.28062

Markus Wallinger, Oscar Navarro, Stephen G. Kobourov: Minimum-Width Drawing of Trees with Sized Vertices https://arxiv.org/abs/2607.27445 https://arxiv.org/pdf/2607.27445 https://arxiv.org/html/2607.27445

[2026-07-31 Fri (UTC), 2 new articles found for csCG Computational Geometry]

[2026-07-30 Thu (UTC), no new articles found for csCG Computational Geometry]

Andreola, Caroppo, Da Lozzo, D'Elia, Di Battista, Frati, Grosso, Patrignani: Extending Biconnected Straight-Line Planar Drawings https://arxiv.org/abs/2607.25756 https://arxiv.org/pdf/2607.25756 https://arxiv.org/html/2607.25756

Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Aikaterini Maria Ntasiou, Maria Eleni Pavlidi, Soeren Terziadis: On the $2$-Bend Slope Number of $1$-Planar Graphs https://arxiv.org/abs/2607.25553 https://arxiv.org/pdf/2607.25553 https://arxiv.org/html/2607.25553

J\'er\^ome Michaud, Sergey Korotov: On Triangulations Generated by the Largest-Angle $n$-Section Algorithm https://arxiv.org/abs/2607.25457 https://arxiv.org/pdf/2607.25457 https://arxiv.org/html/2607.25457

Kelvin Luu, Csaba D. T\'oth: Geometric $(1+\varepsilon)$-Spanners with Few Crossings https://arxiv.org/abs/2607.25040 https://arxiv.org/pdf/2607.25040 https://arxiv.org/html/2607.25040

[2026-07-29 Wed (UTC), 4 new articles found for csCG Computational Geometry]

Daniel Bauer, Jan-Henrik Haunert: Polynomial-time $(k+\epsilon)$-approximation for $k$-coloured Non-crossing Euclidean TSP https://arxiv.org/abs/2607.24628 https://arxiv.org/pdf/2607.24628 https://arxiv.org/html/2607.24628

Ebru Dagdelen, Aakash Karlekar, Manav Arora, Matthew Illingsworth, Jonathan Jaquette, Linda J. Cummings, Lou Kondic: Denoising 3D images: robustness of persistent homology measures https://arxiv.org/abs/2607.24579 https://arxiv.org/pdf/2607.24579 https://arxiv.org/html/2607.24579

Henry F\"orster, Michael Hoffmann, Stephen Kobourov, Maria Eleni Pavlidi, Alexandra Weinberger, Johannes Zink: Weighted Book Thickness https://arxiv.org/abs/2607.24375 https://arxiv.org/pdf/2607.24375 https://arxiv.org/html/2607.24375

Bekos, Depian, Felsner, Kaufmann, Kindermann, Montecchiani, Pavlidi, Weinberger, Wolff, Zink: On the Recognition of Outerplanar Graphs with Queue Number 1 https://arxiv.org/abs/2607.24297 https://arxiv.org/pdf/2607.24297 https://arxiv.org/html/2607.24297

Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin N\"ollenburg: Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms https://arxiv.org/abs/2607.24220 https://arxiv.org/pdf/2607.24220 https://arxiv.org/html/2607.24220

Thomas Depian, Joseph Dorfer, Boris Klemz, Matthias Pfretzschner, Lena Schlipf: Point Set Embeddability with List Constraints https://arxiv.org/abs/2607.24182 https://arxiv.org/pdf/2607.24182 https://arxiv.org/html/2607.24182

Mark de Berg, Debajyoti Kar, Arindam Khan, Rudrayan Kundu: On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares https://arxiv.org/abs/2607.24147 https://arxiv.org/pdf/2607.24147 https://arxiv.org/html/2607.24147

Thomas Depian, Thomas C. van Dijk, Martin N\"ollenburg: Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints https://arxiv.org/abs/2607.23559 https://arxiv.org/pdf/2607.23559 https://arxiv.org/html/2607.23559

Vera Chekan, Robert Ganian, Viktoriia Korchemna: A Fixed-Parameter Algorithm for Extending Upward Planar Drawings https://arxiv.org/abs/2607.23549 https://arxiv.org/pdf/2607.23549 https://arxiv.org/html/2607.23549

Ji Zeng: On balanced circuits in uniform rank-three oriented matroids https://arxiv.org/abs/2607.23385 https://arxiv.org/pdf/2607.23385 https://arxiv.org/html/2607.23385