3 papers
cs.CG2026
Efficient K-Visibility Query in Polygons
Yeganeh Bahoo, Roni Sherman
This paper investigates -visibility, where a line of sight can penetrate up to obstacles. While computing the -visibility polygon from a single query point is well-studie…
cs.CG2026
An Exact Generalized k-Cell Decomposition
Yeganeh Bahoo, Sajad Saeedi, Roni Sherman
This paper introduces an exact -cell decomposition for visibility planning in polygonal environments for agents equipped with -modems, devices that can see through up to …
cs.CG2025
Generalized k-Cell Decomposition for Visibility Planning in Polygons
Yeganeh Bahoo, Sajad Saeedi, Roni Sherman
This paper introduces a novel -cell decomposition method for pursuit-evasion problems in polygonal environments, where a searcher is equipped with a -modem: a device capable…