Theory & Algorithms · Computer Science & AI
Computational Geometry
The newest papers in Computational Geometry that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
90 papers, from 7 September 2026 to 4 November 2026: 90 arXiv preprints.
Get the few papers worth your time in Computational Geometry every morning.
Follow Computational Geometry and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 4
TopTimeNet: Topologically-assisted time-series classification model
Distinguishing periodic from chaotic dynamics in a time series is a fundamental challenge in both physics and engineering.Improved quantum volume estimation with transducers and amortized quantum walks
The volume estimation problem is a classic task in computational geometry.Local Search for Fair Max-Min Diversification
Given $n$ points in a metric space, Max-Min diversification asks for a subset of $k$ points maximizing the minimum pairwise distance between the selected points.Sparse cubical complexes for efficient topology-preservation in image data
Persistent homology (PH) is a frequently used tool for extracting and preserving topological information from image data, particularly in image segmentation, where preservation of topological…Dual lattice attacks for bounded distance decoding, revisited
Analyses of dual lattice attacks have often assumed that the individual scores associated with short dual vectors are mutually independent.A data structure for quotient flag complexes
Vietoris-Rips filtrations, which are standard in topological data analysis, are flag complexes, and a simplex tree stores these without any attaching data.Towards Kinematic Actionable Infeasibility Detection in Motion Planning
Motion planning in robotics requires not only computing collision-free paths but also certifying infeasibility when no such path exists.Geometric Optimization Parameterized by Piercing Complexity
Packing and covering problems for geometric regions have been studied under many notions of complexity, including VC-dimension, union complexity, shallow-cell complexity, and fatness.WildHSR: Metric Feed-Forward 4D People-Scene Reconstruction from a 3D Foundation Model
3D foundation models recover video cameras and geometry in one forward pass, but some of the strongest are up to scale.Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
We study the \textsc{$k$-Disjoint Paths} problem on a graph embedded on a surface with bounded Euler genus.Frame-to-Panorama Localization and Context-Aware Sampling for Scene-Specific Ship Detection in a Smart Marina Testbed
Smart maritime infrastructures provide continuous access to heterogeneous sensing streams, enabling repeated experimentation, digital-twin development, and AI-based maritime services.It's the Geometry, Not the Model: Effective Rank and Subspace Alignment in Functional Connectivity Classification
Resting-state functional connectivity (FC) is widely used to classify brain phenotypes and disorders.$c$-Packedness versus $λ$-Low-Density in Geometric Graphs: Theory and Practice
When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds.Homological Trimming and Regularity of Filtrations via Local Obstruction Modules
Existing link-based combinatorial preprocessing methods speed up the computation of persistent homology by removing a vertex or edge only when its link remains a cone.Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties
In this paper, we study the minimum-cost bipartite matching with penalties problem in metric spaces with bounded doubling dimension: Given two disjoint sets $R, B$ in a metric space $\mathcal{M}$…Fast Geometric Spanners via Approximate Nearest Neighbor Search
We study the problem of constructing metric spanners in general metric spaces in subquadratic time when given blackbox access to a fast algorithm for batch approximate nearest neighbor search.Positive Pair Geometry Matters: Optimal Transport for Contrastive Learning of Visual Representations
Contrastive self-supervised learning has achieved strong performance by learning representations from multiple augmented views of the same image.Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable
In the classical Art Gallery Problem (AGP), guards are placed in a polygon so that together they see every point.The Facility Advantage in the One-Round Discrete Voronoi Game on a Line
In the one-round discrete Voronoi game a multiset $V$ of $n$ voters on a line is given; player P places $k$ facilities, player Q then places $\ell$, and each voter is won by the nearer facility…Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots
Two groups of autonomous, anonymous, and oblivious mobile robots are deployed in the two-dimensional Euclidean plane, each assigned a distinct task.