8 citations · 12 across the 7 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2022
The Rectilinear Steiner Forest Arborescence problem
Łukasz Mielewczyk, Leonidas Palios, Paweł Żyliński
Let be a point in the first quadrant of the plane and let be a set of points such that for any , its - and -coordinate is at…
cs.CG2020★ 2 cited
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility
Bengt J. Nilsson, David Orden, Leonidas Palios +2
We present an time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction , w…