Computational Geometry-Theory and Applications

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

Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	3
Edge guards for polyhedra in three-space	3
Angles of arc-polygons and Lombardi drawings of cacti	2
Editorial Board	2
Editorial Board	2
On exact covering with unit disks	2
Expected size of random Tukey layers and convex layers	2
Editorial Board	2
CGTA Awards	2
The dispersive art gallery problem	2
Discrete Fréchet distance for closed curves	2
Algorithms for the line-constrained disk coverage and related problems	2
A note on the minimum number of red lines needed to pierce the intersections of blue lines	2
Editorial Board	2
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces	2
Range updates and range sum queries on multidimensional points with monoid weights	2
Euclidean minimum spanning trees with independent and dependent geometric uncertainties	2
On path-greedy geometric spanners	2
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	2
A linear optimization oracle for zonotope computation	2
Efficient planar two-center algorithms	2
Decomposition of Geometric Graphs into Star-Forests	2
Lions and contamination: Monotone clearings	1
Global strong convexity and characterization of critical points of time-of-arrival-based source localization	1
Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization	1
Enumerating combinatorial resultant trees	1
A 4-approximation of the 2π3	1
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	1
Crossing lemma for the odd-crossing number	1
Untangling circular drawings: Algorithms and complexity	1
Planar rectilinear drawings of outerplanar graphs in linear time	1
On crossing-families in planar point sets	1
A 2D advancing-front Delaunay mesh refinement algorithm	1
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	1
Maximum-width rainbow-bisecting empty annulus	1
Closest-pair queries and minimum-weight queries are equivalent for squares	1
Geometric triangulations and discrete Laplacians on manifolds: An update	1
Snipperclips: Cutting tools into desired polygons using themselves	1
Dynamic data structures for k-nearest neighbor queries	1
Compression for 2-parameter persistent homology	1
Navigating planar topologies in near-optimal space and time	1
Straight-line drawings of 1-planar graphs	1
Concatenation arguments and their applications to polyominoes and polycubes	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Universality of persistence diagrams and the bottleneck and Wasserstein distances	1
Bounds on the Edge-length Ratio of 2-outerplanar Graphs	1
Efficient segment folding is hard	1
Clustering with faulty centers	1
Erratum to: “Densest Lattice Packings of 3–Polytopes” [Computational Geometry 16 (2000) 157–186]	1
Computing maximum independent set on outerstring graphs and their relatives	1

Coloring Delaunay-edges and their generalizations	1
Implementing straight skeletons with exact arithmetic: Challenges and experiences	1
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	1
Panel-point model for rigidity and flexibility analysis of rigid origami	1
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	1
Editorial Board	1
Minimum rectilinear polygons for given angle sequences	0
Layered drawing of undirected graphs with generalized port constraints	0
Simple linear time algorithms for piercing pairwise intersecting disks	0
1-planarity testing and embedding: An experimental study	0
Constrained Boundary Labeling	0
Algorithms for radius-optimally augmenting trees in a metric space	0
Multi-robot motion planning for unit discs with revolving areas	0
Between shapes, using the Hausdorff distance	0
The parameterized complexity of finding minimum bounded chains	0
Shortcut hulls: Vertex-restricted outer simplifications of polygons	0
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	0
Ununfoldable polyhedra with 6 vertices or 6 faces	0
Editorial Board	0
An algorithm for the construction of the tight span of finite subsets of the Manhattan plane	0
An optimal algorithm for L1 shortest paths in unit-disk graphs	0
Continuous flattening of all polyhedral manifolds using countably infinite creases	0
Advice complexity of online non-crossing matching	0
On the geometric priority set cover problem	0
Editorial Board	0
Parameterized inapproximability of Morse matching	0
On the number of order types in integer grids of small size	0
Editorial Board	0
Packing unequal disks in the Euclidean plane	0
Bottleneck matching in the plane	0
Rational tensegrities through the lens of toric geometry	0
An algorithmic framework for the single source shortest path problem with applications to disk graphs	0
Geodesic obstacle representation of graphs	0
Automatic generation of formulae for polyominoes with a fixed perimeter defect	0
Editorial Board	0
Sparse hop spanners for unit disk graphs	0
Any platonic solid can transform to another by O(1) refoldings	0
Half-plane point retrieval queries with independent and dependent geometric uncertainties	0
The impact of geometry on monochrome regions in the flip Schelling process	0
Rectangular Spiral Galaxies are still hard	0
Solving the minimum convex partition of point sets with integer programming	0
Routing by matching on convex pieces of grid graphs	0
Structured discrete shape approximation: Theoretical complexity and practical algorithm	0
Editorial Board	0
Simplex closing probabilities in directed graphs	0
Augmenting graphs to minimize the radius	0
Complexity results on untangling red-blue matchings	0
Labeling nonograms: Boundary labeling for curve arrangements	0
Maximum number of almost similar triangles in the plane	0
Preface	0
Fréchet distance between two point sets	0
Persistent homology in ℓ∞ metric	0
Largest triangles in a polygon	0
Bounds on soft rectangle packing ratios	0
Geometric dominating-set and set-cover via local-search	0
Time and space efficient collinearity indexing	0
The maximum exposure problem	0
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem	0
Unfolding 3-separated polycube graphs of arbitrary genus	0
On the orthogonal Grünbaum partition problem in dimension three	0
A note on empty balanced tetrahedra in two-colored point sets in R	0
Cut locus realizations on convex polyhedra	0
Folding polyiamonds into octahedra	0
Editorial Board	0
Online class cover problem	0
On dominating set of some subclasses of string graphs	0
Edge-unfolding nested prismatoids	0
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	0
Editorial Board	0
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	0
New formulas for cup-i products and fast computation of Steenrod squares	0
Computing the Fréchet distance between uncertain curves in one dimension	0
Largest unit rectangles inscribed in a convex polygon	0
Editorial Board	0
Empty rainbow triangles in k-colored point sets	0
Geometric firefighting in the half-plane	0
On the line-separable unit-disk coverage and related problems	0
Editorial Board	0
On the enumeration of integer tetrahedra	0
Hierarchical categories in colored searching	0

Covering convex polygons by two congruent disks	0
Distinct distances with ℓ metrics	0
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	0
Distance measures for embedded graphs	0
Attraction-convexity and normal visibility	0
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)	0
Approximating the packedness of polygonal curves	0
On the plane angle-monotone graphs	0
Editorial Board	0
Partial matchings induced by morphisms between persistence modules	0
A note on the k-colored crossing ratio of dense geometric graphs	0
Drawing outerplanar graphs using thirteen edge lengths	0
Editorial Board	0
Extremal convex polygons inscribed in a given convex polygon	0
Maximum-width empty square and rectangular annulus	0
Line segment visibility with sidedness constraints	0
δ-Greedy t-spanner	0
Preface	0
Distance queries over dynamic interval graphs	0
Rectangular partitions of a rectilinear polygon	0
A linear-time algorithm for radius-optimally augmenting paths in a metric space	0
Shortest rectilinear path queries to rectangles in a rectangular domain	0
Approximation algorithms for 1-Wasserstein distance between persistence diagrams	0
Topological regularization via persistence-sensitive optimization	0
Intersecting disks using two congruent disks	0
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains	0
The prefix Fréchet similarity	0
Isometric and affine copies of a set in volumetric Helly results	0
Distance measures for geometric graphs	0
Minimum-link shortest paths for polygons amidst rectilinear obstacles	0
Editorial	0
An exact algorithm for the Euclidean k-Steiner tree problem	0
Flipping in spirals	0
Many order types on integer grids of polynomial size	0
The constant of point–line incidence constructions	0
Editorial Board	0
Piercing pairwise intersecting geodesic disks by five points	0
On the spanning and routing ratios of the directed Θ6-graph	0
Faradžev Read-type enumeration of non-isomorphic CC systems	0
Editorial Board	0
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	0
Isometric deformations of discrete and smooth T-surfaces	0
Sparse convex hull coverage	0
Density of triangulated ternary disc packings	0
Unfolding polycube trees with constant refinement	0
Improved approximation for two-dimensional vector multiple knapsack	0
Routing on heavy path WSPD spanners	0
Approximating Gromov-Hausdorff distance in Euclidean space	0
An efficient three-dimensional face recognition system based random forest and geodesic curves	0
Connectivity of spaces of directed paths in geometric models for concurrent computation	0
Editorial Board	0
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms	0
Keep your distance: Land division with separation	0
Editorial	0
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem	0
Editorial	0
Grid drawings of graphs with constant edge-vertex resolution	0
Editorial Board	0
Inserting an edge into a geometric embedding	0
Unfoldings and nets of regular polytopes	0
Experiments with unit disk cover algorithms for covering massive pointsets	0
An analytical representation of the 2d generalized balanced power diagram	0
Editorial Board	0
Influence-based Voronoi diagrams of clusters	0
On algorithmic complexity of imprecise spanners	0
Impartial achievement games on convex geometries	0
On the upper bound on the average distance from the Fermat-Weber center of a convex body	0
Editorial Board	0
How close is a quad mesh to a polycube?	0
Editorial Board	0
Largest and smallest area triangles on imprecise points	0