Computational Geometry-Theory and Applications

Article	Citations
An efficient three-dimensional face recognition system based random forest and geodesic curves	13
Between shapes, using the Hausdorff distance	9
Two disjoint 5-holes in point sets	8
Planar rectilinear drawings of outerplanar graphs in linear time	7
Universality of persistence diagrams and the bottleneck and Wasserstein distances	7
Efficient planar two-center algorithms	6
On interval decomposability of 2D persistence modules	6
Sparse convex hull coverage	6
On pseudo-disk hypergraphs	5
Solving the minimum convex partition of point sets with integer programming	5
Range closest-pair search in higher dimensions	5
A 2D advancing-front Delaunay mesh refinement algorithm	5
Minimum ply covering of points with disks and squares	5
Experiments with unit disk cover algorithms for covering massive pointsets	5
Distance measures for embedded graphs	4
Dynamic data structures for k-nearest neighbor queries	4
Computing the Fréchet distance between uncertain curves in one dimension	4
Maximum-area and maximum-perimeter rectangles in polygons	4
Fréchet distance between two point sets	4
Maximum-width empty square and rectangular annulus	4
Largest triangles in a polygon	3
Euclidean minimum spanning trees with independent and dependent geometric uncertainties	3
Extending upward planar graph drawings	3
Implementing straight skeletons with exact arithmetic: Challenges and experiences	3
Navigating planar topologies in near-optimal space and time	3

Influence-based Voronoi diagrams of clusters	3
Grid drawings of graphs with constant edge-vertex resolution	3
On the minimum-area rectangular and square annulus problem	3
On dominating set of some subclasses of string graphs	2
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains	2
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms	2
Smallest universal covers for families of triangles	2
Layered drawing of undirected graphs with generalized port constraints	2
Density of triangulated ternary disc packings	2
Simplex closing probabilities in directed graphs	2
Algorithms for the line-constrained disk coverage and related problems	2
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem	2
δ-Greedy t-spanner	2
Largest and smallest area triangles on imprecise points	2
On the number of order types in integer grids of small size	2
Maximum number of almost similar triangles in the plane	2
Concatenation arguments and their applications to polyominoes and polycubes	2
A linear optimization oracle for zonotope computation	2
Discrete Fréchet distance for closed curves	2
Angle-monotonicity of Delaunay triangulation	2
New formulas for cup-i products and fast computation of Steenrod squares	2
Structured discrete shape approximation: Theoretical complexity and practical algorithm	2
Computation of spatial skyline points	2
A linear-time algorithm for radius-optimally augmenting paths in a metric space	2
Multi-robot motion planning for unit discs with revolving areas	2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	2
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	2
Edge guards for polyhedra in three-space	1
Geometric dominating-set and set-cover via local-search	1
Bisecting three classes of lines	1
Sparse hop spanners for unit disk graphs	1
Attraction-convexity and normal visibility	1
Two theorems on point-flat incidences	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
On the upper bound on the average distance from the Fermat-Weber center of a convex body	1
Distance measures for geometric graphs	1
Combinatorics of beacon-based routing in three dimensions	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Compression for 2-parameter persistent homology	1
Coloring Delaunay-edges and their generalizations	1
Untangling circular drawings: Algorithms and complexity	1
Empty rainbow triangles in k-colored point sets	1
On the approximation of shortest escape paths	1
On the spanning and routing ratios of the directed Θ6-graph	1
Acrophobic guard watchtower problem	1
Labeling nonograms: Boundary labeling for curve arrangements	1
An analytical representation of the 2d generalized balanced power diagram	1
Folding polyominoes with holes into a cube	1
Geometric firefighting in the half-plane	1
Shortcut hulls: Vertex-restricted outer simplifications of polygons	1

Soft subdivision motion planning for complex planar robots	1
The maximum exposure problem	1
An algorithm for the construction of the tight span of finite subsets of the Manhattan plane	1
On crossing-families in planar point sets	1
I/O-efficient 2-d orthogonal range skyline and attrition priority queues	1
Computing maximum independent set on outerstring graphs and their relatives	1
Guarantees on nearest-neighbor condensation heuristics	1
Drawing outerplanar graphs using thirteen edge lengths	1
Piercing pairwise intersecting geodesic disks	1
Minimum rectilinear polygons for given angle sequences	1
Continuous flattening of all polyhedral manifolds using countably infinite creases	1
Rectangular partitions of a rectilinear polygon	1
Isometric deformations of discrete and smooth T-surfaces	1
Cut locus realizations on convex polyhedra	1
Complexity results on untangling red-blue matchings	1
Automatic generation of formulae for polyominoes with a fixed perimeter defect	1
Approximating the packedness of polygonal curves	1
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	1
Tilings of the regular N-gon with triangles of angles π/N,π/N,(N − 2)π/N for N = 5,8,10 and 12	1
Angles of arc-polygons and Lombardi drawings of cacti	1
Ununfoldable polyhedra with 6 vertices or 6 faces	0
Connectivity of spaces of directed paths in geometric models for concurrent computation	0
Efficient segment folding is hard	0
Editorial Board	0
Developing a tetramonohedron with minimum cut length	0
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	0
Editorial Board	0
Snipperclips: Cutting tools into desired polygons using themselves	0
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	0
Accelerating iterated persistent homology computations with warm starts	0
Unfolding 3-separated polycube graphs of arbitrary genus	0
Editorial Board	0
CGTA Awards	0
Faradžev Read-type enumeration of non-isomorphic CC systems	0
Editorial Board	0
Editorial Board	0
Distance queries over dynamic interval graphs	0
Geometric triangulations and discrete Laplacians on manifolds: An update	0
Preface	0
Editorial Board	0
Editorial Board	0
Shortest rectilinear path queries to rectangles in a rectangular domain	0
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	0
Editorial Board	0
Editorial Board	0
Global strong convexity and characterization of critical points of time-of-arrival-based source localization	0
Bottleneck matching in the plane	0
A note on empty balanced tetrahedra in two-colored point sets in R	0
Editorial	0
Editorial Board	0
The constant of point–line incidence constructions	0
Simultaneous visibility representations of undirected pairs of graphs	0
Editorial	0
Rational tensegrities through the lens of toric geometry	0
Covering the plane by a sequence of circular disks with a constraint	0
Editorial Board	0
Piercing pairwise intersecting geodesic disks by five points	0
On the geometric priority set cover problem	0
Rectangular Spiral Galaxies are still hard	0
Improved algorithms for the bichromatic two-center problem for pairs of points	0
Edge-unfolding nested prismatoids	0
Editorial Board	0
Panel-point model for rigidity and flexibility analysis of rigid origami	0
Partial matchings induced by morphisms between persistence modules	0
Any platonic solid can transform to another by O(1) refoldings	0
Editorial Board	0
Minimum cuts in geometric intersection graphs	0
Algorithms for radius-optimally augmenting trees in a metric space	0
On path-greedy geometric spanners	0
Intersecting disks using two congruent disks	0
An improved construction for spanners of disks	0
Expected size of random Tukey layers and convex layers	0
On algorithmic complexity of imprecise spanners	0
Value-offset bifiltrations for digital images	0
Many order types on integer grids of polynomial size	0
Distinct distances with ℓ metrics	0
Editorial Board	0
Output sensitive algorithms for approximate incidences and their applications	0
Colouring bottomless rectangles and arborescences	0
The parameterized complexity of finding minimum bounded chains	0

An exact algorithm for the Euclidean k-Steiner tree problem	0
A 4-approximation of the 2π3	0
Editorial Board	0
Generalized class cover problem with axis-parallel strips	0
Editorial Board	0
Isometric and affine copies of a set in volumetric Helly results	0
Straight-line drawings of 1-planar graphs	0
Topological regularization via persistence-sensitive optimization	0
Line segment visibility with sidedness constraints	0
Unfolding polycube trees with constant refinement	0
Enumerating combinatorial resultant trees	0
Inserting an edge into a geometric embedding	0
Clustering with faulty centers	0
Covering convex polygons by two congruent disks	0
Hierarchical categories in colored searching	0
Minimum-link shortest paths for polygons amidst rectilinear obstacles	0
Rearranging a sequence of points onto a line	0
Editorial Board	0
Editorial Board	0
Editorial Board	0
Half-plane point retrieval queries with independent and dependent geometric uncertainties	0
Editorial Board	0
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)	0
Linear-size planar Manhattan network for convex point sets	0
Simple linear time algorithms for piercing pairwise intersecting disks	0
Geodesic obstacle representation of graphs	0
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	0
The impact of geometry on monochrome regions in the flip Schelling process	0
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	0
Bounds on soft rectangle packing ratios	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
Unfoldings and nets of regular polytopes	0
How close is a quad mesh to a polycube?	0
Preface	0
Closest-pair queries and minimum-weight queries are equivalent for squares	0
Augmenting graphs to minimize the radius	0
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment	0
Advice complexity of online non-crossing matching	0
Preface	0
Crossing lemma for the odd-crossing number	0
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem	0
Editorial Board	0
Folding polyiamonds into octahedra	0
Flipping in spirals	0
A note on the minimum number of red lines needed to pierce the intersections of blue lines	0
Impartial achievement games on convex geometries	0
Editorial Board	0
Improved PTASs for convex barrier coverage	0
Editorial Board	0
Maximum-width rainbow-bisecting empty annulus	0
Editorial Board	0
On reverse shortest paths in geometric proximity graphs	0
Editorial Board	0
Persistent homology in ℓ∞ metric	0
Editorial Board	0
1-planarity testing and embedding: An experimental study	0
The prefix Fréchet similarity	0
The dispersive art gallery problem	0
Extremal convex polygons inscribed in a given convex polygon	0
Range updates and range sum queries on multidimensional points with monoid weights	0
On the enumeration of integer tetrahedra	0
Approximating Gromov-Hausdorff distance in Euclidean space	0
Editorial Board	0
Flexibility and rigidity of frameworks consisting of triangles and parallelograms	0
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	0
Rectilinear link diameter and radius in a rectilinear polygonal domain	0
Editorial Board	0
An optimal algorithm for L1 shortest paths in unit-disk graphs	0
Lions and contamination: Monotone clearings	0
Editorial	0
Editorial Board	0
Keep your distance: Land division with separation	0
On the plane angle-monotone graphs	0
Editorial Board	0
Time and space efficient collinearity indexing	0
Editorial	0
Editorial Board	0
Dynamic layers of maxima with applications to dominating queries	0
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	0
Editorial	0