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

Article	Citations
Guarantees on nearest-neighbor condensation heuristics	13
Algorithms for the line-constrained disk coverage and related problems	13
Acrophobic guard watchtower problem	7
Editorial Board	7
Editorial Board	6
Edge guards for polyhedra in three-space	6
Piercing pairwise intersecting geodesic disks	6
Rearranging a sequence of points onto a line	5
Editorial Board	5
Developing a tetramonohedron with minimum cut length	5
Simultaneous visibility representations of undirected pairs of graphs	5
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment	4
Improved algorithms for the bichromatic two-center problem for pairs of points	4
Editorial Board	4
Accelerating iterated persistent homology computations with warm starts	4
Bisecting three classes of lines	4
Linear-size planar Manhattan network for convex point sets	4
Editorial Board	3
Editorial	3
Generalized class cover problem with axis-parallel strips	3
Editorial	3
Value-offset bifiltrations for digital images	3
On path-greedy geometric spanners	3
On interval decomposability of 2D persistence modules	2
Editorial Board	2

Clustering with faulty centers	2
Compression for 2-parameter persistent homology	2
Angles of arc-polygons and Lombardi drawings of cacti	2
Range updates and range sum queries on multidimensional points with monoid weights	2
Editorial Board	2
On the approximation of shortest escape paths	2
Maximum-area and maximum-perimeter rectangles in polygons	2
Editorial Board	2
On reverse shortest paths in geometric proximity graphs	2
Enumerating combinatorial resultant trees	2
Straight-line drawings of 1-planar graphs	2
Navigating planar topologies in near-optimal space and time	2
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	2
Discrete Fréchet distance for closed curves	2
Colouring bottomless rectangles and arborescences	2
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	2
Global strong convexity and characterization of critical points of time-of-arrival-based source localization	2
Untangling circular drawings: Algorithms and complexity	2
Geometric triangulations and discrete Laplacians on manifolds: An update	2
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	2
The dispersive art gallery problem	2
Maximum-width rainbow-bisecting empty annulus	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Expected size of random Tukey layers and convex layers	1
Closest-pair queries and minimum-weight queries are equivalent for squares	1
A 4-approximation of the 2π3	1
Dynamic layers of maxima with applications to dominating queries	1
I/O-efficient 2-d orthogonal range skyline and attrition priority queues	1
Editorial Board	1
Approximating the packedness of polygonal curves	1
Hierarchical categories in colored searching	1
Snipperclips: Cutting tools into desired polygons using themselves	1
On crossing-families in planar point sets	1
Editorial Board	1
Universality of persistence diagrams and the bottleneck and Wasserstein distances	1
Editorial Board	1
Computing maximum independent set on outerstring graphs and their relatives	1
Crossing lemma for the odd-crossing number	1
Erratum to: “Densest Lattice Packings of 3–Polytopes” [Computational Geometry 16 (2000) 157–186]	1
Approximating Gromov-Hausdorff distance in Euclidean space	1
Lions and contamination: Monotone clearings	1
Editorial Board	1
The constant of point–line incidence constructions	1
Minimum cuts in geometric intersection graphs	1
Editorial Board	1
Efficient planar two-center algorithms	1
Panel-point model for rigidity and flexibility analysis of rigid origami	1
Dynamic data structures for k-nearest neighbor queries	1
A 2D advancing-front Delaunay mesh refinement algorithm	1
A note on the minimum number of red lines needed to pierce the intersections of blue lines	1

A linear optimization oracle for zonotope computation	1
CGTA Awards	1
Efficient segment folding is hard	1
Editorial Board	1
The parameterized complexity of finding minimum bounded chains	1
Rational tensegrities through the lens of toric geometry	1
On the geometric priority set cover problem	1
Coloring Delaunay-edges and their generalizations	1
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	1
Euclidean minimum spanning trees with independent and dependent geometric uncertainties	1
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	1