3 papers
cs.CG2026
On Reconstructing a Convex Polygon from Partial Information
Alexander Baumann, Therese Biedl, Mahmoud Elashmawi +4
The reconstruction problem asks to construct a (convex) polygon that has a specified set of features, such as an ordered set of edge-lengths or an ordered set of polygon-angles. In…
cs.CG2025
Terrain prickliness: theoretical grounds for high complexity viewsheds
Ankush Acharyya, Maarten Löffler, Gert G. T. Meijer +3
An important task in terrain analysis is computing \emph{viewsheds}. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewp…
cs.CG2024
Computing largest minimum color-spanning intervals of imprecise points
Ankush Acharyya, Vahideh Keikha, Maria Saumell +1
We study a geometric facility location problem under imprecision. Given unit intervals in the real line, each with one of colors, the goal is to place one point in each int…