2 citations · 4 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model
Jonas Cleve, Wolfgang Mulzer
We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, t…
cs.CG2019
Routing in Histograms
Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5
Let be an -monotone orthogonal polygon with vertices. We call a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…