Computational Geometry-Theory and Applications

Article	Citations
An efficient three-dimensional face recognition system based random forest and geodesic curves	13
Fast and compact planar embeddings	12
Between shapes, using the Hausdorff distance	8
Computing multiparameter persistent homology through a discrete Morse-based approach	8
Evacuating equilateral triangles and squares in the face-to-face model	6
Two disjoint 5-holes in point sets	5
Shortest paths and convex hulls in 2D complexes with non-positive curvature	5
Sparse convex hull coverage	5
Planar rectilinear drawings of outerplanar graphs in linear time	5
Reconstructing embedded graphs from persistence diagrams	5
Solving the minimum convex partition of point sets with integer programming	5
Efficient planar two-center algorithms	5
Packing plane spanning trees into a point set	4
Universality of persistence diagrams and the bottleneck and Wasserstein distances	4
On pseudo-disk hypergraphs	4
Topological inference of manifolds with boundary	4
Minimum ply covering of points with disks and squares	4
Experiments with unit disk cover algorithms for covering massive pointsets	4
Extending upward planar graph drawings	3
Approximate range closest-pair queries	3
Grid drawings of graphs with constant edge-vertex resolution	3
Euclidean minimum spanning trees with independent and dependent geometric uncertainties	3
1-bend upward planar slope number of SP-digraphs	3
Distance measures for embedded graphs	3
Influence-based Voronoi diagrams of clusters	3

K-dominance in multidimensional data: Theory and applications	3
A 2D advancing-front Delaunay mesh refinement algorithm	3
On interval decomposability of 2D persistence modules	3
On the minimum-area rectangular and square annulus problem	3
Range closest-pair search in higher dimensions	3
Maximum-width empty square and rectangular annulus	3
Implementing straight skeletons with exact arithmetic: Challenges and experiences	3
Parallel computation of alpha complexes for biomolecules	3
Computation of spatial skyline points	2
Routing in polygonal domains	2
A linear-time algorithm for radius-optimally augmenting paths in a metric space	2
On crossing-families in planar point sets	2
Progressive simplification of polygonal curves	2
Dihedral deformation and rigidity	2
Angle-monotonicity of Delaunay triangulation	2
Smallest universal covers for families of triangles	2
Largest and smallest area triangles on imprecise points	2
Layered drawing of undirected graphs with generalized port constraints	2
On the number of order types in integer grids of small size	2
Concatenation arguments and their applications to polyominoes and polycubes	2
A linear optimization oracle for zonotope computation	2
Maximum-area and maximum-perimeter rectangles in polygons	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
δ-Greedy t-spanner	2
Largest triangles in a polygon	2
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut	2
On prescribing total orders and preorders to pairwise distances of points in Euclidean space	2
Plane hop spanners for unit disk graphs: Simpler and better	2
Algorithms for the line-constrained disk coverage and related problems	2
Fréchet distance between two point sets	2
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem	2
Structured discrete shape approximation: Theoretical complexity and practical algorithm	2
An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures	1
Drawing outerplanar graphs using thirteen edge lengths	1
An algorithm for the construction of the tight span of finite subsets of the Manhattan plane	1
Labeling nonograms: Boundary labeling for curve arrangements	1
Middle curves based on discrete Fréchet distance	1
On dominating set of some subclasses of string graphs	1
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	1
Multi-robot motion planning for unit discs with revolving areas	1
Dynamic data structures for k-nearest neighbor queries	1
The maximum exposure problem	1
Universal hinge patterns for folding strips efficiently into any grid polyhedron	1
Bisecting three classes of lines	1
Acrophobic guard watchtower problem	1
On the upper bound on the average distance from the Fermat-Weber center of a convex body	1
Two theorems on point-flat incidences	1
Empty rainbow triangles in k-colored point sets	1
Approximating the packedness of polygonal curves	1

Geometric dominating-set and set-cover via local-search	1
Simplex closing probabilities in directed graphs	1
On the spanning and routing ratios of the directed Θ6-graph	1
Symmetric assembly puzzles are hard, beyond a few pieces	1
Hamiltonicity for convex shape Delaunay and Gabriel graphs	1
Angles of arc-polygons and Lombardi drawings of cacti	1
Maximum number of almost similar triangles in the plane	1
I/O-efficient 2-d orthogonal range skyline and attrition priority queues	1
Cut locus realizations on convex polyhedra	1
Trajectory planning for an articulated probe	1
Navigating planar topologies in near-optimal space and time	1
Edge guards for polyhedra in three-space	1
Complexity results on untangling red-blue matchings	1
On the approximation of shortest escape paths	1
Automatic generation of formulae for polyominoes with a fixed perimeter defect	1
Folding polyominoes with holes into a cube	1
Geometric firefighting in the half-plane	1
Optimal Art Gallery Localization is NP-hard	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Attraction-convexity and normal visibility	1
Extending Erdős–Beck's theorem to higher dimensions	1
Minimum rectilinear polygons for given angle sequences	1
Combinatorics of beacon-based routing in three dimensions	1
Sparse hop spanners for unit disk graphs	1
Untangling circular drawings: Algorithms and complexity	1
Distance measures for geometric graphs	1
Tilings of the regular N-gon with triangles of angles π/N,π/N,(N − 2)π/N for N = 5,8,10 and 12	1
Finding minimum witness sets in orthogonal polygons	1
Coloring Delaunay-edges and their generalizations	1
Piercing pairwise intersecting geodesic disks	1
Self-approaching paths in simple polygons	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
Computing the Fréchet distance between uncertain curves in one dimension	1
Soft subdivision motion planning for complex planar robots	1
Density of triangulated ternary disc packings	1
Continuous flattening of all polyhedral manifolds using countably infinite creases	1
Rearranging a sequence of points onto a line	0
Editorial Board	0
Unfolding 3-separated polycube graphs of arbitrary genus	0
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises	0
Improved algorithms for the bichromatic two-center problem for pairs of points	0
New formulas for cup-i products and fast computation of Steenrod squares	0
Impartial achievement games on convex geometries	0
The dispersive art gallery problem	0
Colouring bottomless rectangles and arborescences	0
Augmenting graphs to minimize the radius	0
Keep your distance: Land division with separation	0
Geometric triangulations and discrete Laplacians on manifolds: An update	0
Inserting an edge into a geometric embedding	0
Gathering by repulsion	0
Compression for 2-parameter persistent homology	0
Editorial	0
A note on empty balanced tetrahedra in two-colored point sets in R	0
Editorial Board	0
Dynamic layers of maxima with applications to dominating queries	0
On the plane angle-monotone graphs	0
Editorial Board	0
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)	0
Piercing families of convex sets in the plane that avoid a certain subfamily with lines	0
Editorial Board	0
Routing by matching on convex pieces of grid graphs	0
On reverse shortest paths in geometric proximity graphs	0
Extremal convex polygons inscribed in a given convex polygon	0
Lions and contamination: Monotone clearings	0
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus	0
Preface	0
Editorial Board	0
Editorial Board	0
Expected size of random Tukey layers and convex layers	0
Editorial Board	0
Editorial Board	0
Rectilinear link diameter and radius in a rectilinear polygonal domain	0
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets	0
Efficient segment folding is hard	0
Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword	0
Simple linear time algorithms for piercing pairwise intersecting disks	0
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword	0
Accelerating Iterated Persistent Homology Computations with Warm Starts	0
Editorial Board	0
Decomposing filtered chain complexes: Geometry behind barcoding algorithms	0

Value-offset bifiltrations for digital images	0
The impact of geometry on monochrome regions in the flip Schelling process	0
Intersecting disks using two congruent disks	0
Editorial Board	0
Linear-size planar Manhattan network for convex point sets	0
Partial matchings induced by morphisms between persistence modules	0
Advice complexity of online non-crossing matching	0
Editorial Board	0
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment	0
The prefix Fréchet similarity	0
Ununfoldable polyhedra with 6 vertices or 6 faces	0
Enumerating combinatorial resultant trees	0
Discrete Fréchet distance for closed curves	0
Algorithms for radius-optimally augmenting trees in a metric space	0
Any platonic solid can transform to another by O(1) refoldings	0
Straight-line drawings of 1-planar graphs	0
Shortest rectilinear path queries to rectangles in a rectangular domain	0
Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7]	0
Crossing lemma for the odd-crossing number	0
Editorial Board	0
Unfolding polycube trees with constant refinement	0
Preface	0
Editorial Board	0
Shortcut hulls: Vertex-restricted outer simplifications of polygons	0
Editorial Board	0
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem	0
Approximating Gromov-Hausdorff distance in Euclidean space	0
Problems on track runners	0
Editorial Board	0
Guarantees on nearest-neighbor condensation heuristics	0
On the geometric priority set cover problem	0
A 4-approximation of the 2π3	0
Editorial	0
Foreword	0
On algorithmic complexity of imprecise spanners	0
Colored anchored visibility representations in 2D and 3D space	0
A note on the minimum number of red lines needed to pierce the intersections of blue lines	0
Editorial Board	0
Rectangular Spiral Galaxies are still hard	0
The constant of point–line incidence constructions	0
Snipperclips: Cutting tools into desired polygons using themselves	0
Flipping in spirals	0
Output sensitive algorithms for approximate incidences and their applications	0
Editorial Board	0
Editorial Board	0
Faradžev Read-type enumeration of non-isomorphic CC systems	0
Improved PTASs for convex barrier coverage	0
On path-greedy geometric spanners	0
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs	0
Folding polyiamonds into octahedra	0
Line segment visibility with sidedness constraints	0
Simultaneous visibility representations of undirected pairs of graphs	0
Time and space efficient collinearity indexing	0
Many order types on integer grids of polynomial size	0
Clustering with faulty centers	0
Editorial Board	0
Isometric and affine copies of a set in volumetric Helly results	0
How close is a quad mesh to a polycube?	0
Range updates and range sum queries on multidimensional points with monoid weights	0
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions	0
Minimum-link shortest paths for polygons amidst rectilinear obstacles	0
Editorial Board	0
Editorial Board	0
Persistent homology in ℓ∞ metric	0
Editorial Board	0
CGTA Awards	0
Distinct distances with ℓ metrics	0
Editorial Board	0
Editorial Board	0
Edge-unfolding nested prismatoids	0
Minimum cuts in geometric intersection graphs	0
Editorial Board	0
Editorial Board	0
Unfoldings and nets of regular polytopes	0
Editorial Board	0
Approximation algorithms for geometric conflict free covering problems	0
The most-likely skyline problem for stochastic points	0
How to play hot and cold	0
1-planarity testing and embedding: An experimental study	0
Computing maximum independent set on outerstring graphs and their relatives	0
Half-plane point retrieval queries with independent and dependent geometric uncertainties	0
Preface	0
Covering the plane by a sequence of circular disks with a constraint	0
Editorial Board	0
Closest-pair queries and minimum-weight queries are equivalent for squares	0
Preface	0
Editorial	0
Editorial Board	0
Improved approximation bounds for the minimum constraint removal problem	0
An improved construction for spanners of disks	0
Editorial	0
Developing a tetramonohedron with minimum cut length	0
On the shortest separating cycle	0
Rectangular partitions of a rectilinear polygon	0
Packing boundary-anchored rectangles and squares	0