2 papers
cs.CG2022
Farthest-point Voronoi diagrams in the presence of rectangular obstacles
Mincheol Kim, Chanyang Seo, Taehoon Ahn +1
We present an algorithm to compute the geodesic farthest-point Voronoi diagram of point sites in the presence of rectangular obstacles in the plane. It takes $O(nm+n…
cs.CG2021
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles
Mincheol Kim, Hee-Kap Ahn
Consider two axis-aligned rectilinear simple polygons in the domain consisting of axis-aligned rectilinear obstacles in the plane such that the bounding boxes, one for each obstacl…