1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
Linear time single-source shortest path algorithms in Euclidean graph classes
Joachim Gudmundsson, Yuan Sha, Sampson Wong
In the celebrated paper of Henzinger, Klein, Rao and Subramanian (1997), it was shown that planar graphs admit a linear time single-source shortest path algorithm. Their algorithm…
cs.CG2020★ 1 cited
Approximating the packedness of polygonal curves
Joachim Gudmundsson, Yuan Sha, Sampson Wong
In 2012 Driemel et al. \cite{DBLP:journals/dcg/DriemelHW12} introduced the concept of -packed curves as a realistic input model. In the case when is a constant they gave a n…