OOIR: Observatory of International Research

Papers

(The TQCC of Computational Geometry-Theory and Applications is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-08-01 to 2026-08-01.)

Article	Citations
Generalized class cover problem with axis-parallel strips	11
Value-offset bifiltrations for digital images	11
Colouring bottomless rectangles and arborescences	11
Geometric TSP on sets	10
Connected matchings	9
On reverse shortest paths in geometric proximity graphs	7
Editorial Board	7
Bounds on the edge-length ratio of 2-outerplanar graphs	6
Crossing lemma for the odd-crossing number	6
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	6
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	5
CGTA	5
1-planarity testing and embedding: An experimental study	5
Pattern formation for fat robots with lights	4
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
Editorial	4
Time and space efficient collinearity indexing	4
Maximum number of almost similar triangles in the plane	4
How close is a quad mesh to a polycube?	4
On the line-separable unit-disk coverage and related problems	4
An optimal algorithm for L1 shortest paths in unit-disk graphs	4
Rational tensegrities through the lens of toric geometry	4
Algorithms for computing closest points for segments	4
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	4
Complexity results on untangling red-blue matchings	3

Accelerating iterated persistent homology computations with warm starts	3
On path-greedy geometric spanners	3
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	3
Editorial Board	3
Developing a tetramonohedron with minimum cut length	3
Editorial Board	3
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	3
Editorial Board	3
Bottleneck matching in the plane	3
Decomposition of geometric graphs into star-forests	3
Revisiting the Fréchet distance between piecewise smooth curves	3
Packing d-dimensional balls into a d + 1-dimensional container	2
Topological regularization via persistence-sensitive optimization	2
Routing on heavy path WSPD spanners	2
Distance measures for geometric graphs	2
Untangling circular drawings: Algorithms and complexity	2
Clustering with faulty centers	2
A note on the k-colored crossing ratio of dense geometric graphs	2
Rectangular drawing of cubic graphs on an annulus and a Möbius band	2
Multi-robot motion planning for unit discs with revolving areas	2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	2
CGTA Awards	2
The dispersive art gallery problem	2
Simplex closing probabilities in directed graphs	2
Panel-point model for rigidity and flexibility analysis of rigid origami	2
Flips in odd matchings	2
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	2
Range updates and range sum queries on multidimensional points with monoid weights	2