OOIR: Observatory of International Research

Papers

(The TQCC of Computational Geometry-Theory and Applications is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-03-01 to 2024-03-01.)

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
Cut locus realizations on convex polyhedra	1
An algorithm for the construction of the tight span of finite subsets of the Manhattan plane	1
Middle curves based on discrete Fréchet distance	1
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model	1
Complexity results on untangling red-blue matchings	1
Dynamic data structures for k-nearest neighbor queries	1
Folding polyominoes with holes into a cube	1
Universal hinge patterns for folding strips efficiently into any grid polyhedron	1
Optimal Art Gallery Localization is NP-hard	1
Bisecting three classes of lines	1
Attraction-convexity and normal visibility	1
Acrophobic guard watchtower problem	1
Minimum rectilinear polygons for given angle sequences	1
Sparse hop spanners for unit disk graphs	1
Two theorems on point-flat incidences	1
Approximating the packedness of polygonal curves	1

Distance measures for geometric graphs	1
Simplex closing probabilities in directed graphs	1
Finding minimum witness sets in orthogonal polygons	1
Symmetric assembly puzzles are hard, beyond a few pieces	1
Angles of arc-polygons and Lombardi drawings of cacti	1
I/O-efficient 2-d orthogonal range skyline and attrition priority queues	1
An algorithmic framework for the single source shortest path problem with applications to disk graphs	1
Trajectory planning for an articulated probe	1
Soft subdivision motion planning for complex planar robots	1
Navigating planar topologies in near-optimal space and time	1
Continuous flattening of all polyhedral manifolds using countably infinite creases	1
Edge guards for polyhedra in three-space	1
Drawing outerplanar graphs using thirteen edge lengths	1
On the approximation of shortest escape paths	1
Labeling nonograms: Boundary labeling for curve arrangements	1
Automatic generation of formulae for polyominoes with a fixed perimeter defect	1
On dominating set of some subclasses of string graphs	1
Geometric firefighting in the half-plane	1
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces	1
Multi-robot motion planning for unit discs with revolving areas	1
Extending Erdős–Beck's theorem to higher dimensions	1
The maximum exposure problem	1
Combinatorics of beacon-based routing in three dimensions	1
Untangling circular drawings: Algorithms and complexity	1
Tilings of the regular N-gon with triangles of angles π/N,π/N,(N − 2)π/N for N = 5,8,10 and 12	1
On the upper bound on the average distance from the Fermat-Weber center of a convex body	1
Coloring Delaunay-edges and their generalizations	1
Empty rainbow triangles in k-colored point sets	1
Piercing pairwise intersecting geodesic disks	1
Geometric dominating-set and set-cover via local-search	1
Self-approaching paths in simple polygons	1
On the spanning and routing ratios of the directed Θ6-graph	1
Hamiltonicity for convex shape Delaunay and Gabriel graphs	1
Computing the Fréchet distance between uncertain curves in one dimension	1
Maximum number of almost similar triangles in the plane	1
Density of triangulated ternary disc packings	1