Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
Sign Up to like & getrecommendations! Published in 2022 at "Algorithmica"
DOI: 10.48550/arxiv.2203.03198
Abstract: We present an algorithm to compute the geodesic $$L_1$$ L 1 farthest-point Voronoi diagram of m point sites in the presence of n rectangular obstacles in the plane. It takes $$O(nm+n \log n + m\log… read more here.
Keywords: presence; point voronoi; log; farthest point ... See more keywords