Discrete & Computational Geometry

Papers
(The TQCC of Discrete & Computational Geometry is 2. 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-10-01 to 2025-10-01.)
ArticleCitations
Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications17
A Tight Analysis of Geometric Local Search8
Geodesic Geometry on Graphs7
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions7
Pair Crossing Number, Cutwidth, and Good Drawings on Arbitrary Point Sets7
Bipartite Diameter and Other Measures Under Translation7
Local Criteria for Triangulating General Manifolds7
Lines on $$K3$$–Quartics Via Triangular Sets6
The Convex Hull of Random Points on the Boundary of a Simple Polytope6
Transversals to Colorful Intersecting Convex Sets6
Discrete Yamabe Problem for Polyhedral Surfaces6
A New Face Iterator for Polyhedra and for More General Finite Locally Branched Lattices6
Noncrossing Partition Lattices from Planar Configurations6
A Universal Triangulation for Flat Tori5
Compact Metric Spaces with Infinite Cop Number5
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile5
Completeness for the Complexity Class $$\forall \exists \mathbb {R}$$ and Area-Universality5
Fat Triangles Inscribed in Arbitrary Planar Domains5
No-Dimensional Tverberg Theorems and Algorithms4
On the Square Peg Problem4
On Fast Johnson–Lindenstrauss Embeddings of Compact Submanifolds of $$\mathbbm {R}^N$$ with Boundary4
The Complex Plank Problem, Revisited4
Combinatorics of Intervals in the Plane I: Trapezoids4
A Lower Bound Theorem for Strongly Regular CW Spheres with up to $$2d+1$$ Vertices4
Algorithms for Halfplane Coverage and Related Problems4
Extreme Points of Gram Spectrahedra of Binary Forms4
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays4
Euclidean TSP in Narrow Strips4
Fertilitopes4
More Bisections by Hyperplane Arrangements4
No-Dimensional Tverberg Partitions Revisited4
Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature4
On an Equichordal Property of a Pair of Convex Bodies4
Numerical Semigroups via Projections and via Quotients3
Weighted Ehrhart Series and a Type-$$\textsf{B}$$ Analogue of a Formula of MacMahon3
Concyclic Intervals in the Plane3
Topology and Local Geometry of the Eden Model3
Guest Editors’ Foreword3
Combining Realization Space Models of Polytopes3
On the Smallest Density of Non-Separable Lattices3
Subdivision of Maps of Digital Images3
Distortion Reversal in Aperiodic Tilings3
An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes3
Improved Routing on the Delaunay Triangulation3
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems3
Covering Point-Sets with Parallel Hyperplanes and Sparse Signal Recovery3
The Duality of the Volumes and the Numbers of Vertices of Random Polytopes3
A Structural Szemerédi–Trotter Theorem for Cartesian Products3
Nearly k-Distance Sets3
Intersection Searching amid Tetrahedra in Four Dimensions3
Computing p-Presentation Distances is Hard3
Nets in $$\mathbb {P}^2$$ and Alexander Duality3
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing3
On Short Edges in Complete Topological Graphs3
Foreword3
Tropical Compactification via Ganter’s Algorithm3
Discrete Constant Mean Curvature Cylinders and Isothermic Tori3
Towards Uniform Online Spherical Tessellations3
Discrete $$\ell ^{1}$$ Double Bubble Solution is at Most Ceiling Plus Two of the Continuous Solution3
Transversals and Colorings of Simplicial Spheres3
Generating an Equidistributed Net on a Sphere Using Random Rotations3
New Constructions Related to the Polynomial Sphere Recognition Problem3
Extracting Persistent Clusters in Dynamic Data via Möbius Inversion3
Fragmenting any Parallelepiped into a Signed Tiling2
Monochromatic Infinite Sets in Minkowski Planes2
Efficient Algorithms for the Dense Packing of Congruent Circles Inside a Square2
The Structure of Metrizable Graphs2
Field Choice Problem in Persistent Homology2
Complexity of Maximum Cut on Interval Graphs2
Periodic Steiner Networks Minimizing Length2
Barycentric Cuts Through a Convex Body2
PQ-Type Adjacency Polytopes of Join Graphs2
Corrected Curvature Measures2
Inductive Freeness of Ziegler’s Canonical Multiderivations2
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons2
Admissible Reversing and Extended Symmetries for Bijective Substitutions2
Distinct Distances on Non-Ruled Surfaces and Between Circles2
Approximating Maximum Integral Multiflows on Bounded Genus Graphs2
Volumes of Subset Minkowski Sums and the Lyusternik Region2
Morse Shellings Out of Discrete Morse Functions2
The Geometry of Random Tournaments2
Set-Valued Recursions Arising from Vantage-Point Trees2
Random Zonotopes and Valuations2
Minimal Delaunay Triangulations of Hyperbolic Surfaces2
Improved Algebraic Degeneracy Testing2
On Some Non-Rigid Unit Distance Patterns2
Topological Optimization with Big Steps2
Bounds for the Regularity Radius of Delone Sets2
Convexity, Elementary Methods, and Distances2
Translational Tiling with 8 Polyominoes is Undecidable2
Discrete Morse Theory for Computing Zigzag Persistence2
Tutte Embeddings of Tetrahedral Meshes2
On the Maximal Distance Between the Centers of Mass of a Planar Convex Body and Its Boundary2
Relative Persistent Homology2
Extendability of Simplicial Maps is Undecidable2
Homotopy Theory in Digital Topology2
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube2
Average and Expected Distortion of Voronoi Paths and Scapes2
Plurality in Spatial Voting Games with Constant $$\beta $$2
Determinant of the Finite Volume Laplacian2
Connectivity of Triangulation Flip Graphs in the Plane2
Lonely Points in Simplices2
Spaces of Geodesic Triangulations of Surfaces2
Convex Polytopes, Dihedral Angles, Mean Curvature and Scalar Curvature2
Three-Dimensional Graph Products with Unbounded Stack-Number2
Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances2
Efficient Folding Algorithms for Convex Polyhedra2
Width Deviation of Convex Polygons2
Ehrhart Quasi-Polynomials of Almost Integral Polytopes2
Euclidean Gallai–Ramsey for Various Configurations2
Embedding Divisor and Semi-Prime Testability in f-Vectors of Polytopes2
Peeling Sequences2
Zigzags in Combinatorial Tetrahedral Chains and the Associated Markov Chain2
0.1258749961853