Computational Geometry-Theory and Applications

Article	Citations
Editorial Board	18
On reverse shortest paths in geometric proximity graphs	17
Value-offset bifiltrations for digital images	8
Generalized class cover problem with axis-parallel strips	7
Colouring bottomless rectangles and arborescences	7
Editorial Board	6
Closest-pair queries and minimum-weight queries are equivalent for squares	6
Crossing lemma for the odd-crossing number	6
Computing maximum independent set on outerstring graphs and their relatives	5
1-planarity testing and embedding: An experimental study	5
Expected size of random Tukey layers and convex layers	5
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	5
Universality of persistence diagrams and the bottleneck and Wasserstein distances	5
Preface	4
Rational tensegrities through the lens of toric geometry	4
Implementing straight skeletons with exact arithmetic: Challenges and experiences	4
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	4
Editorial	4
On the line-separable unit-disk coverage and related problems	4
Editorial Board	3
On the upper bound on the average distance from the Fermat-Weber center of a convex body	3
Editorial Board	3
How close is a quad mesh to a polycube?	3
Time and space efficient collinearity indexing	3
An optimal algorithm for L1 shortest paths in unit-disk graphs	3

Persistent homology in ℓ∞ metric	3
Ununfoldable polyhedra with 6 vertices or 6 faces	3
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	3
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	3
Bottleneck matching in the plane	3
Maximum number of almost similar triangles in the plane	3
Editorial Board	2
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	2
The dispersive art gallery problem	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
CGTA Awards	2
Linear-size planar Manhattan network for convex point sets	2
Accelerating iterated persistent homology computations with warm starts	2
Developing a tetramonohedron with minimum cut length	2
Editorial Board	2
Range updates and range sum queries on multidimensional points with monoid weights	2
Complexity results on untangling red-blue matchings	2
On path-greedy geometric spanners	2
An efficient three-dimensional face recognition system based random forest and geodesic curves	2
Efficient planar two-center algorithms	2
Clustering with faulty centers	2
Enumerating combinatorial resultant trees	1
Editorial	1
On the plane angle-monotone graphs	1
Topological regularization via persistence-sensitive optimization	1
Editorial Board	1
Multi-robot motion planning for unit discs with revolving areas	1
Half-plane point retrieval queries with independent and dependent geometric uncertainties	1
Untangling circular drawings: Algorithms and complexity	1
Panel-point model for rigidity and flexibility analysis of rigid origami	1
Planar rectilinear drawings of outerplanar graphs in linear time	1
Routing on heavy path WSPD spanners	1
Piercing pairwise intersecting geodesic disks by five points	1
Solving the minimum convex partition of point sets with integer programming	1
Improved algorithms for the bichromatic two-center problem for pairs of points	1
Acrophobic guard watchtower problem	1
Impartial achievement games on convex geometries	1
Editorial Board	1
Distance measures for geometric graphs	1
On the enumeration of integer tetrahedra	1
Inserting an edge into a geometric embedding	1
Simplex closing probabilities in directed graphs	1
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	1
Euclidean minimum spanning trees with independent and dependent geometric uncertainties	1
Minimum-link shortest paths for polygons amidst rectilinear obstacles	1
The prefix Fréchet similarity	1
Editorial Board	1
Discrete Fréchet distance for closed curves	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
Structured discrete shape approximation: Theoretical complexity and practical algorithm	1

Editorial Board	1
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	1
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	1
Editorial Board	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
A note on the k-colored crossing ratio of dense geometric graphs	1
Distance queries over dynamic interval graphs	1
Covering convex polygons by two congruent disks	1
Grid drawings of graphs with constant edge-vertex resolution	1
Packing unequal disks in the Euclidean plane	0
Bounds on soft rectangle packing ratios	0
Hierarchical categories in colored searching	0
Geometric dominating-set and set-cover via local-search	0
A linear-time algorithm for radius-optimally augmenting paths in a metric space	0
Faradžev Read-type enumeration of non-isomorphic CC systems	0
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	0
Influence-based Voronoi diagrams of clusters	0
Editorial Board	0
Intersecting disks using two congruent disks	0
The parameterized complexity of finding minimum bounded chains	0
δ-Greedy t-spanner	0
Fréchet distance between two point sets	0
Continuous flattening of all polyhedral manifolds using countably infinite creases	0
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms	0
Edge-unfolding nested prismatoids	0
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment	0
The impact of geometry on monochrome regions in the flip Schelling process	0
Folding polyiamonds into octahedra	0
Algorithms for the line-constrained disk coverage and related problems	0
Erratum to: “Densest Lattice Packings of 3–Polytopes” [Computational Geometry 16 (2000) 157–186]	0
Unfoldings and nets of regular polytopes	0
Editorial Board	0
Editorial Board	0
Coloring Delaunay-edges and their generalizations	0
Improved approximation for two-dimensional vector multiple knapsack	0
Editorial Board	0
Editorial Board	0
Dynamic data structures for k-nearest neighbor queries	0
Geodesic obstacle representation of graphs	0
Drawing outerplanar graphs using thirteen edge lengths	0
Editorial Board	0
Efficient segment folding is hard	0
Shortest rectilinear path queries to rectangles in a rectangular domain	0
Approximating the packedness of polygonal curves	0
Snipperclips: Cutting tools into desired polygons using themselves	0
Editorial Board	0
Editorial Board	0
Online class cover problem	0
The maximum exposure problem	0
On the geometric priority set cover problem	0
Approximating Gromov-Hausdorff distance in Euclidean space	0
Minimum rectilinear polygons for given angle sequences	0
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)	0
Any platonic solid can transform to another by O(1) refoldings	0
Computing the Fréchet distance between uncertain curves in one dimension	0
Editorial Board	0
VHS: a package for homological simplification of voxelized plant root data for skeletonization	0
Largest triangles in a polygon	0
Editorial Board	0
A linear optimization oracle for zonotope computation	0
Line segment visibility with sidedness constraints	0
On crossing-families in planar point sets	0
Isometric deformations of discrete and smooth T-surfaces	0
Labeling nonograms: Boundary labeling for curve arrangements	0
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	0
Editorial Board	0
An analytical representation of the 2d generalized balanced power diagram	0
Simple linear time algorithms for piercing pairwise intersecting disks	0
Keep your distance: Land division with separation	0
Editorial Board	0
Rectangular Spiral Galaxies are still hard	0
Unfolding 3-separated polycube graphs of arbitrary genus	0
Bisecting three classes of lines	0
Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization	0
Partial matchings induced by morphisms between persistence modules	0
Editorial	0
Editorial	0
Compression for 2-parameter persistent homology	0
Editorial Board	0
Algorithms for radius-optimally augmenting trees in a metric space	0

Connectivity of spaces of directed paths in geometric models for concurrent computation	0
Preface	0
Geometric triangulations and discrete Laplacians on manifolds: An update	0
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem	0
A note on the minimum number of red lines needed to pierce the intersections of blue lines	0
Editorial Board	0
Shortcut hulls: Vertex-restricted outer simplifications of polygons	0
Editorial Board	0
Maximum-width rainbow-bisecting empty annulus	0
Distinct distances with ℓ metrics	0
Layered drawing of undirected graphs with generalized port constraints	0
Lions and contamination: Monotone clearings	0
Simultaneous visibility representations of undirected pairs of graphs	0
Experiments with unit disk cover algorithms for covering massive pointsets	0
Editorial Board	0
Largest unit rectangles inscribed in a convex polygon	0
On interval decomposability of 2D persistence modules	0
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem	0
Advice complexity of online non-crossing matching	0
Automatic generation of formulae for polyominoes with a fixed perimeter defect	0
Concatenation arguments and their applications to polyominoes and polycubes	0
Unfolding polycube trees with constant refinement	0
Rectangular partitions of a rectilinear polygon	0
The constant of point–line incidence constructions	0
Sparse hop spanners for unit disk graphs	0
An exact algorithm for the Euclidean k-Steiner tree problem	0
New formulas for cup-i products and fast computation of Steenrod squares	0
Straight-line drawings of 1-planar graphs	0
Cut locus realizations on convex polyhedra	0
Editorial Board	0
Extremal convex polygons inscribed in a given convex polygon	0
Between shapes, using the Hausdorff distance	0
On dominating set of some subclasses of string graphs	0
Piercing pairwise intersecting geodesic disks	0
On the spanning and routing ratios of the directed Θ6-graph	0
Maximum-width empty square and rectangular annulus	0
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains	0
Global strong convexity and characterization of critical points of time-of-arrival-based source localization	0
A note on empty balanced tetrahedra in two-colored point sets in R	0
Isometric and affine copies of a set in volumetric Helly results	0
Routing by matching on convex pieces of grid graphs	0
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	0
Editorial	0
Augmenting graphs to minimize the radius	0
A 4-approximation of the 2π3	0
Attraction-convexity and normal visibility	0
On algorithmic complexity of imprecise spanners	0
Navigating planar topologies in near-optimal space and time	0
Rearranging a sequence of points onto a line	0
Parameterized inapproximability of Morse matching	0
Angles of arc-polygons and Lombardi drawings of cacti	0
On the orthogonal Grünbaum partition problem in dimension three	0
Many order types on integer grids of polynomial size	0
Density of triangulated ternary disc packings	0
A 2D advancing-front Delaunay mesh refinement algorithm	0
Edge guards for polyhedra in three-space	0
Editorial Board	0
Sparse convex hull coverage	0