1 citations · 3 across the 12 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Fréchet Distance in Unweighted Planar Graphs
Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg +1
The Fréchet distance is a distance measure between trajectories in or walks in a graph . Given constant-time shortest path queries, the Discrete Fréchet distance $D_…
cs.CG2018
A Greedy Heuristic for Crossing-Angle Maximization
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze +2
The crossing angle of a straight-line drawing of a graph is the smallest angle between two crossing edges in . Deciding whether a graph has a straight-line dr…