OOIR: Observatory of International Research

Papers

(The TQCC of Computational Geometry-Theory and Applications is 1. 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-01-01 to 2026-01-01.)

Article	Citations
Colouring bottomless rectangles and arborescences	24
Value-offset bifiltrations for digital images	10
On reverse shortest paths in geometric proximity graphs	9
Editorial Board	7
Geometric TSP on sets	7
Generalized class cover problem with axis-parallel strips	7
Connected matchings	7
Bounds on the edge-length ratio of 2-outerplanar graphs	6
Computing maximum independent set on outerstring graphs and their relatives	6
Editorial Board	5
Expected size of random Tukey layers and convex layers	5
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	5
Closest-pair queries and minimum-weight queries are equivalent for squares	4
Crossing lemma for the odd-crossing number	4
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	4
CGTA	4
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
On the line-separable unit-disk coverage and related problems	4
1-planarity testing and embedding: An experimental study	4
Rational tensegrities through the lens of toric geometry	3
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	3
Pattern formation for fat robots with lights	3
Time and space efficient collinearity indexing	3
Algorithms for computing closest points for segments	3
Editorial	3

Editorial Board	3
Persistent homology in ℓ∞ metric	3
Ununfoldable polyhedra with 6 vertices or 6 faces	3
How close is a quad mesh to a polycube?	3
Maximum number of almost similar triangles in the plane	3
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	3
Preface	3
Editorial Board	2
Revisiting the Fréchet distance between piecewise smooth curves	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
CGTA Awards	2
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	2
Bottleneck matching in the plane	2
Developing a tetramonohedron with minimum cut length	2
Linear-size planar Manhattan network for convex point sets	2
Decomposition of geometric graphs into star-forests	2
On path-greedy geometric spanners	2
Complexity results on untangling red-blue matchings	2
An optimal algorithm for L1 shortest paths in unit-disk graphs	2
Accelerating iterated persistent homology computations with warm starts	2
Editorial Board	2
Untangling circular drawings: Algorithms and complexity	2
Editorial Board	2
Simplex closing probabilities in directed graphs	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Range updates and range sum queries on multidimensional points with monoid weights	1
Planar rectilinear drawings of outerplanar graphs in linear time	1
The prefix Fréchet similarity	1
Pattern formation for fat robots with memory	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
Half-plane point retrieval queries with independent and dependent geometric uncertainties	1
Minimum-link shortest paths for polygons amidst rectilinear obstacles	1
Distance measures for geometric graphs	1
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	1
Clustering with faulty centers	1
Rectangular drawing of cubic graphs on an annulus and a Möbius band	1
The dispersive art gallery problem	1
Editorial Board	1
Distance queries over dynamic interval graphs	1
Editorial Board	1
Editorial Board	1
Growth rates of the number of empty triangles and simplices	1
Inserting an edge into a geometric embedding	1
Multi-robot motion planning for unit discs with revolving areas	1
Topological regularization via persistence-sensitive optimization	1
Panel-point model for rigidity and flexibility analysis of rigid origami	1
A note on the k-colored crossing ratio of dense geometric graphs	1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	1
On the enumeration of integer tetrahedra	1
On the plane angle-monotone graphs	1

Piercing pairwise intersecting geodesic disks by five points	1
Covering convex polygons by two congruent disks	1
Editorial Board	1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	1
Flips in odd matchings	1
Routing on heavy path WSPD spanners	1