It is shown that every n-vertex graph that admits a 2-bend RAC drawing i...
A fundamental question in computational geometry is for a dynamic collec...
Motivated by the problem of redistricting, we study area-preserving
reco...
We introduce the Observation Route Problem () defined as
follows: Given ...
For a polygon P with holes in the plane, we denote by ϱ(P) the
ratio bet...
We prove that, given a polyhedron 𝒫 in ℝ^3, every point
in ℝ^3 that does...
Given a set S of n points in the plane and a parameter ε>0, a
Euclidean ...
Lightness and sparsity are two natural parameters for Euclidean
(1+ε)-sp...
For a finite set A⊂ℝ^d, let Δ(A) denote the spread
of A, which is the ra...
Given a metric space ℳ=(X,δ), a weighted graph G over X
is a metric t-sp...
A t-spanner of a graph G=(V,E) is a subgraph H=(V,E') that contains a
uv...
A generic rectangular layout (for short, layout) is a
subdivision of an ...
In this paper, we study the online Euclidean spanners problem for points...
Lightness is a fundamental parameter for Euclidean spanners; it is the r...
Motivated by applications in gerrymandering detection, we study a
reconf...
Lightness and sparsity are two natural parameters for Euclidean
(1+ε)-sp...
Every finite graph admits a simple (topological) drawing, that is, a
dra...
We consider the construction of a polygon P with n vertices whose turnin...
Given a colored point set in the plane, a perfect rainbow polygon is a
s...
Motivated by indoor localization by tripwire lasers, we study the proble...
We introduce and study the problem of constructing geometric graphs that...
Let P and Q be finite point sets of the same cardinality in
ℝ^2, each la...
A unit disk graph G on a given set of points P in the plane is a
geometr...
This is the arXiv index for the electronic proceedings of GD 2019, which...
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no
k p...
We study the atomic embeddability testing problem, which is a common
gen...
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of
P...
The classical measure of similarity between two polygonal chains in Eucl...
Given a planar straight-line graph G=(V,E) in R^2, a
circumscribing poly...
Motivated by recent computational models for redistricting and detection...
With the popularity of portable wireless devices it is important to mode...
Due to data compression or low resolution, nearby vertices and edges of ...
Given a point set S={s_1,... , s_n} in the unit square U=[0,1]^2, an
anc...
We present an efficient algorithm for a problem in the interface between...
We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs
t...
We revisit the online Unit Clustering problem in higher dimensions: Give...