Back to search

University of British Columbia

Computing the attention center of a simple polygon

Abstract

dc:description

We introduce a new definition of center for a simple polygon P called the attention center, which is the point c inside P that minimizes the maximum geodesic distance from any p ∈ P to the visibility region of c. We survey various definitions of center which use geodesically convex distance metrics on simple polygons and their algorithms. We show attention distance is not geodesically convex but instead geodesically quasiconvex, a concept mostly seen to this point in the study of Riemannian manifolds, and present an algorithm which calculates the attention center of a simple polygon with n vertices to within error ε in O(n² log n/ε) time.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
University of British Columbia
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Brown, Dylan
Contributors dc:contributor
  • Evans, William

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/88711

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Brown, Dylan. Computing the attention center of a simple polygon. master's thesis, University of British Columbia, 2024. http://hdl.handle.net/2429/88711