research
∙
04/25/2023
Simply Realising an Imprecise Polyline is NP-hard
We consider the problem of deciding, given a sequence of regions, if the...
share
research
∙
03/15/2023
Shortest Paths in Portalgons
Any surface that is intrinsically polyhedral can be represented by a col...
research
∙
10/11/2022
Morphing Planar Graph Drawings Through 3D
In this paper, we investigate crossing-free 3D morphs between planar str...
research
∙
08/26/2022
A Subquadratic n^ε-approximation for the Continuous Fréchet Distance
The Fréchet distance is a commonly used similarity measure between curve...
research
∙
03/16/2022
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals
We consider drawings of graphs in the plane in which vertices are assign...
research
∙
03/03/2022
Efficient Fréchet distance queries for segments
We study the problem of constructing a data structure that can store a t...
research
∙
05/20/2021
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
We consider the problem of computing the Fréchet distance between two cu...
research
∙
03/11/2021
Polygon-Universal Graphs
We study a fundamental question from graph drawing: given a pair (G,C) o...
research
∙
10/17/2020
Automatic Tree Ring Detection using Jacobi Sets
Tree ring widths are an important source of climatic and historical data...
research
∙
09/30/2020
Between Shapes, Using the Hausdorff Distance
Given two shapes A and B in the plane with Hausdorff distance 1, is ther...
research
∙
07/15/2020
A family of metrics from the truncated smoothing of Reeb graphs
In this paper, we introduce an extension of smoothing on Reeb graphs, wh...
research
∙
08/15/2019
Homotopy height, grid-major height and graph-drawing height
It is well-known that both the pathwidth and the outer-planarity of a gr...
research
∙
12/29/2018
Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
research
∙
07/23/2018
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
We show by reduction from the Orthogonal Vectors problem that algorithms...
research
∙
11/02/2017
