# PhD Seminar • Algorithms and Complexity • The Visibility Center of a Simple Polygon

Thursday, July 7, 2022 — 2:00 PM to 3:00 PM EDT

## Please note: This PhD seminar will be given online.

Anurag Murty Naredla, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Anna Lubiw

Two points in a polygon see each other if the line segment joining them does not exit the polygon. Based on this well-studied notion, we introduce the visibility center of a set of points inside a polygon — a point c such that the maximum geodesic distance from c to see any point in the set is minimized. For a simple polygon of n vertices and a set of m points inside it, we give an O((n + m) log (n + m)) time algorithm to find the visibility center. We find the visibility center of all points in a simple polygon in O(n log n) time.

Our algorithm reduces the visibility center problem to the problem of finding the geodesic center of a set of half-polygons inside a polygon, which is of independent interest. We give an O((n + k) log(n + k)) time algorithm for this problem, where k is the number of half-polygons.

Joint work with Anna Lubiw.

To join this PhD seminar on Zoom, please go to https://uwaterloo.zoom.us/j/98651937935.

Location
Online PhD seminar
200 University Avenue West

Waterloo, ON N2L 3G1
Event tags

### June 2024

S M T W T F S
26
27
28
29
30
31
1
2
3
4
7
8
9
10
15
16
17
22
23
24
25
26
29
30
1
2
3
4
5
6
1. 2024 (166)
1. August (3)
2. July (6)
3. June (16)
4. May (23)
5. April (41)
6. March (27)
7. February (25)
8. January (25)
2. 2023 (296)
1. December (20)
2. November (28)
3. October (15)
4. September (25)
5. August (30)
6. July (30)
7. June (22)
8. May (23)
9. April (32)
10. March (31)
11. February (18)
12. January (22)
3. 2022 (245)
4. 2021 (210)
5. 2020 (217)
6. 2019 (255)
7. 2018 (217)
8. 2017 (36)
9. 2016 (21)
10. 2015 (36)
11. 2014 (33)
12. 2013 (23)
13. 2012 (4)
14. 2011 (1)
15. 2010 (1)
16. 2009 (1)
17. 2008 (1)