Computational Geometry-Theory and Applications

Article	Citations
Colouring bottomless rectangles and arborescences	10
Value-offset bifiltrations for digital images	10
Connected matchings	10
Geometric TSP on sets	8
Generalized class cover problem with axis-parallel strips	8
On reverse shortest paths in geometric proximity graphs	7
Editorial Board	7
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	6
Crossing lemma for the odd-crossing number	5
CGTA	5
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	5
Bounds on the edge-length ratio of 2-outerplanar graphs	5
On the line-separable unit-disk coverage and related problems	5
Rational tensegrities through the lens of toric geometry	4
Maximum number of almost similar triangles in the plane	4
How close is a quad mesh to a polycube?	4
1-planarity testing and embedding: An experimental study	4
Editorial	4
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
Algorithms for computing closest points for segments	4
Time and space efficient collinearity indexing	4
Complexity results on untangling red-blue matchings	3
Developing a tetramonohedron with minimum cut length	3
On path-greedy geometric spanners	3
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	3

Editorial Board	3
Editorial Board	3
An optimal algorithm for L1 shortest paths in unit-disk graphs	3
Pattern formation for fat robots with lights	3
Bottleneck matching in the plane	3
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	3
Clustering with faulty centers	2
A note on the k-colored crossing ratio of dense geometric graphs	2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	2
Packing d-dimensional balls into a d + 1-dimensional container	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
Untangling circular drawings: Algorithms and complexity	2
Accelerating iterated persistent homology computations with warm starts	2
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	2
Panel-point model for rigidity and flexibility analysis of rigid origami	2
Range updates and range sum queries on multidimensional points with monoid weights	2
Revisiting the Fréchet distance between piecewise smooth curves	2
CGTA Awards	2
The dispersive art gallery problem	2
Simplex closing probabilities in directed graphs	2
Routing on heavy path WSPD spanners	2
Editorial Board	2
Decomposition of geometric graphs into star-forests	2
Editorial Board	1
Flips in odd matchings	1
Topological regularization via persistence-sensitive optimization	1
Acrophobic guard watchtower problem	1
VHS: A package for homological simplification of voxelized plant root data for skeletonization	1
Layered drawing of undirected graphs with generalized port constraints	1
Experiments with unit disk cover algorithms for covering massive pointsets	1
Enumerating combinatorial resultant trees	1
On the enumeration of integer tetrahedra	1
Editorial Board	1
Editorial Board	1
Half-plane point retrieval queries with independent and dependent geometric uncertainties	1
Distance queries over dynamic interval graphs	1
Multi-robot motion planning for unit discs with revolving areas	1
Growth rates of the number of empty triangles and simplices	1
On exact covering with unit disks	1
Editorial Board	1
The maximum exposure problem	1
Line segment visibility with sidedness constraints	1
Discrete Fréchet distance for closed curves	1
Editorial Board	1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	1
Distance measures for geometric graphs	1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	1
Covering convex polygons by two congruent disks	1
Pattern formation for fat robots with memory	1
Approximation of MWIS on geometric intersection graphs	1

Many order types on integer grids of polynomial size	1
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	1
Editorial Board	1
Editorial	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
Piercing pairwise intersecting geodesic disks by five points	1
On crossing-families in planar point sets	0
Folding polyiamonds into octahedra	0
Piercing unit geodesic disks	0
Edge guards for polyhedra in three-space	0
Angles of arc-polygons and Lombardi drawings of cacti	0
Maximum inscribed and minimum enclosing tropical balls of tropical polytopes and applications to volume estimation and uniform sampling	0
Largest unit rectangles inscribed in a convex polygon	0
Geometric triangulations and discrete Laplacians on manifolds: An update	0
Navigating planar topologies in near-optimal space and time	0
On algorithmic complexity of imprecise spanners	0
Editorial Board	0
A 4-approximation of the 2π3	0
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem	0
Keep your distance: Land division with separation	0
Realizable dimension of periodic frameworks	0
Optimal bound for PCA with outliers using higher-degree Voronoi diagrams	0
On the orthogonal Grünbaum partition problem in dimension three	0
On line-separable weighted unit-disk coverage and related problems	0
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem	0
Advice complexity of online non-crossing matching	0
Editorial Board	0
Preface	0
Intersecting disks using two congruent disks	0
Guarding points on a terrain by watchtowers	0
Realizability of free spaces of curves	0
Efficient segment folding is hard	0
Isometric deformations of discrete and smooth T-surfaces	0
Editorial Board	0
Partial matchings induced by morphisms between persistence modules	0
Routing by matching on convex pieces of grid graphs	0
Erratum to: “Densest Lattice Packings of 3–Polytopes” [Computational Geometry 16 (2000) 157–186]	0
Constrained boundary labeling	0
Dynamic data structures for k-nearest neighbor queries	0
Improved approximation for two-dimensional vector multiple knapsack	0
Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees	0
Simple linear time algorithms for piercing pairwise intersecting disks	0
Lions and contamination: Monotone clearings	0
Online class cover problem	0
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	0
Cut locus realizations on convex polyhedra	0
On the geometric priority set cover problem	0
On interval decomposability of 2D persistence modules	0
Global strong convexity and characterization of critical points of time-of-arrival-based source localization	0
Big line or big convex polygon	0
Approximating Gromov-Hausdorff distance in Euclidean space	0
A note on the minimum number of red lines needed to pierce the intersections of blue lines	0
Straight-line drawings of 1-planar graphs	0
Editorial	0
Bounds on soft rectangle packing ratios	0
The constant of point–line incidence constructions	0
Unfolding 3-separated polycube graphs of arbitrary genus	0
Computing the Fréchet distance between uncertain curves in one dimension	0
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)	0
Density of triangulated ternary disc packings	0
Editorial Board	0
New formulas for cup-i products and fast computation of Steenrod squares	0
Approximating average bounded-angle minimum spanning trees	0
Any platonic solid can transform to another by O(1) refoldings	0
Automatic generation of formulae for polyominoes with a fixed perimeter defect	0
Geometric and algorithmic solutions to the generalised alibi query	0
Minimum-width double-slabs and widest empty slabs in high dimensions	0
Rearranging a sequence of points onto a line	0
Editorial Board	0
The impact of geometry on monochrome regions in the flip Schelling process	0
Editorial Board	0
Finding a largest-area triangle in a terrain in near-linear time	0
An analytical representation of the 2d generalized balanced power diagram	0
Editorial Board	0
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	0
Editorial Board	0
Compression for 2-parameter persistent homology	0
Geodesic obstacle representation of graphs	0
Hierarchical categories in colored searching	0
Edge-unfolding nested prismatoids	0

Rectangular Spiral Galaxies are still hard	0
Maximizing the maximum degree in ordered nearest neighbor graphs	0
Parallel line centers with guaranteed separation	0
m-Watchmen's routes in minbar and generalized minbar polygons	0
Algorithms for the line-constrained disk coverage and related problems	0
Maximum-width rainbow-bisecting empty annulus	0
Editorial Board	0
Editorial Board	0
On the structure of extremal point-line arrangements	0
Augmenting graphs to minimize the radius	0
Drawing outerplanar graphs using thirteen edge lengths	0
City guarding with cameras of bounded field of view	0
Editorial Board	0
Editorial Board	0
Algorithms for radius-optimally augmenting trees in a metric space	0
Infinite circle packings on surfaces with conical singularities	0
Geometric dominating-set and set-cover via local-search	0
Approximating the packedness of polygonal curves	0
Shortcut hulls: Vertex-restricted outer simplifications of polygons	0
On dominating set of some subclasses of string graphs	0
An exact algorithm for the Euclidean k-Steiner tree problem	0
Rectangular partitions of a rectilinear polygon	0
Editorial Board	0
Editorial Board	0
Unfoldings and nets of regular polytopes	0
Editorial	0
Editorial Board	0
Editorial Board	0
On the spanning and routing ratios of the directed Θ6-graph	0
Connectivity of spaces of directed paths in geometric models for concurrent computation	0
On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs	0
A geometric condition for uniqueness of Fréchet means of persistence diagrams	0
Editorial Board	0
Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization	0
Approximation algorithms for 1-Wasserstein distance between persistence diagrams	0
The parameterized complexity of finding minimum bounded chains	0
Packing unequal disks in the Euclidean plane	0
Editorial	0
Parameterized inapproximability of Morse matching	0