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-06-01 to 2026-06-01.)

Article	Citations
Colouring bottomless rectangles and arborescences	11
Generalized class cover problem with axis-parallel strips	10
Value-offset bifiltrations for digital images	10
Geometric TSP on sets	9
On reverse shortest paths in geometric proximity graphs	8
Editorial Board	7
Connected matchings	7
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	6
Bounds on the edge-length ratio of 2-outerplanar graphs	5
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	5
CGTA	5
On the line-separable unit-disk coverage and related problems	5
Crossing lemma for the odd-crossing number	5
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
Editorial	4
Time and space efficient collinearity indexing	4
How close is a quad mesh to a polycube?	4
1-planarity testing and embedding: An experimental study	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
Maximum number of almost similar triangles in the plane	4
Editorial Board	3
Editorial Board	3

On path-greedy geometric spanners	3
Bottleneck matching in the plane	3
Complexity results on untangling red-blue matchings	3
Developing a tetramonohedron with minimum cut length	3
Editorial Board	3
Pattern formation for fat robots with lights	3
Accelerating iterated persistent homology computations with warm starts	3
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	3
Panel-point model for rigidity and flexibility analysis of rigid origami	2
The dispersive art gallery problem	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
Untangling circular drawings: Algorithms and complexity	2
Packing d-dimensional balls into a d + 1-dimensional container	2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	2
Routing on heavy path WSPD spanners	2
Revisiting the Fréchet distance between piecewise smooth curves	2
CGTA Awards	2
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	2
Simplex closing probabilities in directed graphs	2
Topological regularization via persistence-sensitive optimization	2
Clustering with faulty centers	2
Decomposition of geometric graphs into star-forests	2
Range updates and range sum queries on multidimensional points with monoid weights	2
A note on the k-colored crossing ratio of dense geometric graphs	2
Covering convex polygons by two congruent disks	1
Approximation of MWIS on geometric intersection graphs	1
Pattern formation for fat robots with memory	1
Many order types on integer grids of polynomial size	1
Editorial Board	1
Editorial Board	1
Discrete Fréchet distance for closed curves	1
Piercing pairwise intersecting geodesic disks by five points	1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	1
Editorial Board	1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	1
Flips in odd matchings	1
Acrophobic guard watchtower problem	1
VHS: A package for homological simplification of voxelized plant root data for skeletonization	1
Experiments with unit disk cover algorithms for covering massive pointsets	1
The maximum exposure problem	1
Enumerating combinatorial resultant trees	1
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	1
On the enumeration of integer tetrahedra	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
Ordered Yao graphs: maximum degree, edge density, and clique numbers	1
Distance measures for geometric graphs	1
Growth rates of the number of empty triangles and simplices	1
Editorial	1
Editorial Board	1

Layered drawing of undirected graphs with generalized port constraints	1
Line segment visibility with sidedness constraints	1
On exact covering with unit disks	1
Editorial Board	1
Editorial Board	1
Multi-robot motion planning for unit discs with revolving areas	1
Distance queries over dynamic interval graphs	1