2 citations · 4 across the 12 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022★ 1 cited
The thickness of fan-planar graphs is at most three
Otfried Cheong, Maximilian Pfister, Lena Schlipf
We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that…
cs.CG2022
Efficient Fréchet distance queries for segments
Maike Buchin, Ivor van der Hoog, Tim Ophelders +3
We study the problem of constructing a data structure that can store a two-dimensional polygonal curve , such that for any query segment one can efficiently comp…