We study the following problem: Given a set S of n points in the plane,
...
An obstacle representation of a graph G consists of a set of pairwise
di...
We consider point sets in the real projective plane ℝP^2 and
explore var...
For integers d ≥ 2 and k ≥ d+1, a k-hole in a set S of points
in general...
A k-crossing family in a point set S in general position is a set of k
s...
Betweenness centrality is a centrality measure based on the overall amou...
Let V_n be a set of n points in the plane and let x ∉ V_n. An
x-loop is ...
A page (queue) with respect to a vertex ordering of a graph is a set of ...
Proceedings of GD2020: This volume contains the papers presented at GD 2...
We study upward planar straight-line embeddings (UPSE) of directed trees...
Let P be a set of 2n points in convex position, such that n points are
c...
For d ∈ℕ, let S be a finite set of points in ℝ^d
in general position. A ...
Let A be an arrangement of n lines in the Euclidean plane. The
<i>k-leve...
In order to have a compact visualization of the order type of a given po...
We study the 1-planar, quasi-planar, and fan-planar crossing number in
c...
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
Let P be a set of n points in strictly convex position in the plane. Let...