Computational Geometry-Theory and Applications

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-08-01 to 2025-08-01.)
ArticleCitations
Editorial Board19
On reverse shortest paths in geometric proximity graphs18
Value-offset bifiltrations for digital images8
Editorial Board7
Generalized class cover problem with axis-parallel strips7
Crossing lemma for the odd-crossing number7
Colouring bottomless rectangles and arborescences7
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus6
Closest-pair queries and minimum-weight queries are equivalent for squares6
Computing maximum independent set on outerstring graphs and their relatives5
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures5
Expected size of random Tukey layers and convex layers5
Universality of persistence diagrams and the bottleneck and Wasserstein distances5
1-planarity testing and embedding: An experimental study5
Preface4
On the line-separable unit-disk coverage and related problems4
Rational tensegrities through the lens of toric geometry4
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]3
Editorial Board3
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs3
Bottleneck matching in the plane3
Maximum number of almost similar triangles in the plane3
Time and space efficient collinearity indexing3
On the upper bound on the average distance from the Fermat-Weber center of a convex body3
Editorial Board3
Editorial3
How close is a quad mesh to a polycube?3
Ununfoldable polyhedra with 6 vertices or 6 faces3
An optimal algorithm for L1 shortest paths in unit-disk graphs3
Persistent homology in ℓ∞ metric3
The dispersive art gallery problem2
Range updates and range sum queries on multidimensional points with monoid weights2
Efficient planar two-center algorithms2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space2
CGTA Awards2
Accelerating iterated persistent homology computations with warm starts2
Developing a tetramonohedron with minimum cut length2
Editorial Board2
Clustering with faulty centers2
Planar rectilinear drawings of outerplanar graphs in linear time2
Editorial Board2
Complexity results on untangling red-blue matchings2
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions2
On path-greedy geometric spanners2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces2
Untangling circular drawings: Algorithms and complexity2
A note on the k-colored crossing ratio of dense geometric graphs2
An efficient three-dimensional face recognition system based random forest and geodesic curves2
Linear-size planar Manhattan network for convex point sets2
Editorial Board1
On the enumeration of integer tetrahedra1
Editorial Board1
Editorial Board1
Solving the minimum convex partition of point sets with integer programming1
Discrete Fréchet distance for closed curves1
Acrophobic guard watchtower problem1
Multi-robot motion planning for unit discs with revolving areas1
On the plane angle-monotone graphs1
Distance queries over dynamic interval graphs1
The prefix Fréchet similarity1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces1
Panel-point model for rigidity and flexibility analysis of rigid origami1
Half-plane point retrieval queries with independent and dependent geometric uncertainties1
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises1
Editorial Board1
Grid drawings of graphs with constant edge-vertex resolution1
Covering convex polygons by two congruent disks1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms1
Piercing pairwise intersecting geodesic disks by five points1
Inserting an edge into a geometric embedding1
Topological regularization via persistence-sensitive optimization1
Impartial achievement games on convex geometries1
Simplex closing probabilities in directed graphs1
Distance measures for geometric graphs1
Editorial Board1
Concatenation arguments and their applications to polyominoes and polycubes1
Enumerating combinatorial resultant trees1
Improved algorithms for the bichromatic two-center problem for pairs of points1
An algorithmic framework for the single source shortest path problem with applications to disk graphs1
Minimum-link shortest paths for polygons amidst rectilinear obstacles1
Editorial1
Structured discrete shape approximation: Theoretical complexity and practical algorithm1
Routing on heavy path WSPD spanners1
0.089937210083008