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 2021-12-01 to 2025-12-01.)

Article	Citations
Colouring bottomless rectangles and arborescences	23
Value-offset bifiltrations for digital images	10
On reverse shortest paths in geometric proximity graphs	8
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	7
Editorial Board	7
Expected size of random Tukey layers and convex layers	6
Closest-pair queries and minimum-weight queries are equivalent for squares	5
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	5
Editorial Board	5
Crossing lemma for the odd-crossing number	5
1-planarity testing and embedding: An experimental study	4
On the line-separable unit-disk coverage and related problems	4
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
CGTA	4
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	4
Computing maximum independent set on outerstring graphs and their relatives	4
Editorial	3
Maximum number of almost similar triangles in the plane	3
How close is a quad mesh to a polycube?	3
Time and space efficient collinearity indexing	3
Pattern formation for fat robots with lights	3
Rational tensegrities through the lens of toric geometry	3

Preface	3
Editorial Board	3
Persistent homology in ℓ∞ metric	3
Editorial Board	3
Ununfoldable polyhedra with 6 vertices or 6 faces	3
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	3
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	3
An optimal algorithm for L1 shortest paths in unit-disk graphs	3
Complexity results on untangling red-blue matchings	2
Developing a tetramonohedron with minimum cut length	2
On path-greedy geometric spanners	2
Revisiting the Fréchet distance between piecewise smooth curves	2
The dispersive art gallery problem	2
Bottleneck matching in the plane	2
Editorial Board	2
Untangling circular drawings: Algorithms and complexity	2
Decomposition of geometric graphs into star-forests	2
Range updates and range sum queries on multidimensional points with monoid weights	2
Accelerating iterated persistent homology computations with warm starts	2
Linear-size planar Manhattan network for convex point sets	2
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
CGTA Awards	2
Editorial Board	2
Structured discrete shape approximation: Theoretical complexity and practical algorithm	1
Multi-robot motion planning for unit discs with revolving areas	1
Distance measures for geometric graphs	1
Panel-point model for rigidity and flexibility analysis of rigid origami	1
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	1
Clustering with faulty centers	1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	1
Editorial	1
Editorial Board	1
Pattern formation for fat robots with memory	1
Half-plane point retrieval queries with independent and dependent geometric uncertainties	1
On the plane angle-monotone graphs	1
Flips in odd matchings	1
Topological regularization via persistence-sensitive optimization	1
Simplex closing probabilities in directed graphs	1
A note on the k-colored crossing ratio of dense geometric graphs	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Minimum-link shortest paths for polygons amidst rectilinear obstacles	1
On exact covering with unit disks	1
Piercing pairwise intersecting geodesic disks by five points	1
Editorial Board	1
Editorial Board	1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	1
Editorial Board	1
Routing on heavy path WSPD spanners	1
Planar rectilinear drawings of outerplanar graphs in linear time	1

Distance queries over dynamic interval graphs	1
The prefix Fréchet similarity	1
Inserting an edge into a geometric embedding	1
Covering convex polygons by two congruent disks	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
On the enumeration of integer tetrahedra	1