mirror of
https://github.com/GSA/notifications-admin.git
synced 2026-08-11 17:38:50 -04:00
We want to know how many phones are in a user-supplied polygon, so we can show the impact of a broadcast, in the same way that we do when users pick areas from our library. We already know how many phones are in each electoral ward. But there are challenges with an arbitrary polygon: - where it does overlap a ward, the overlap could be partial - it could overlap more than one ward - finding out which wards it overlaps by brute force (looping through all the wards and seeing which ones intersect with our polygon) would be way to slow to do in real time Instead we can use a data structure called an R-tree[1] to build an index which provides a much, much faster way of looking up which polygons overlap another. We can build this tree in advance and save it somewhere, which means there’s a lot of computation we don’t need to do in real time. The R-tree returns a set of objects (ward IDs) which we can go and look up in our library of electoral wards. These wards will be the ones that might have some overlap with our custom polygon. Once we have this small set of wards which might overlap our ward, we can look at the size of the area of overlap (relative to the size of the whole ward) and multiply that by the known count of phones in that ward to get an approximation of the count of phones in the overlap area. Summing these approximations give an estimate for the whole area of the custom polygon. 1. https://en.wikipedia.org/wiki/R-tree
227 lines
6.6 KiB
Python
227 lines
6.6 KiB
Python
import math
|
||
from abc import ABC, abstractmethod
|
||
|
||
from notifications_utils.formatters import formatted_list
|
||
from notifications_utils.polygons import Polygons
|
||
from notifications_utils.serialised_model import SerialisedModelCollection
|
||
from werkzeug.utils import cached_property
|
||
|
||
from .populations import CITY_OF_LONDON
|
||
from .repo import BroadcastAreasRepository, rtree_index
|
||
|
||
|
||
class SortableMixin:
|
||
|
||
def __repr__(self):
|
||
return f'{self.__class__.__name__}(<{self.id}>)'
|
||
|
||
def __lt__(self, other):
|
||
# Implementing __lt__ means any classes inheriting from this
|
||
# method are sortable
|
||
return self.name < other.name
|
||
|
||
def __eq__(self, other):
|
||
return self.id == other.id
|
||
|
||
def __hash__(self):
|
||
return hash(self.id)
|
||
|
||
|
||
class GetItemByIdMixin:
|
||
def get(self, id):
|
||
for item in self:
|
||
if item.id == id:
|
||
return item
|
||
raise KeyError(id)
|
||
|
||
|
||
class BaseBroadcastArea(ABC):
|
||
|
||
@property
|
||
@abstractmethod
|
||
def simple_polygons(self):
|
||
pass
|
||
|
||
@property
|
||
@abstractmethod
|
||
def polygons(self):
|
||
pass
|
||
|
||
@property
|
||
@abstractmethod
|
||
def count_of_phones(self):
|
||
pass
|
||
|
||
@cached_property
|
||
def simple_polygons_with_bleed(self):
|
||
return self.simple_polygons.bleed_by(self.estimated_bleed_in_degrees)
|
||
|
||
@cached_property
|
||
def phone_density(self):
|
||
if not self.polygons.estimated_area:
|
||
return 0
|
||
return self.count_of_phones / self.polygons.estimated_area
|
||
|
||
@property
|
||
def estimated_bleed_in_m(self):
|
||
'''
|
||
Estimates the amount of bleed based on the population of an
|
||
area. Higher density areas tend to have short range masts, so
|
||
the bleed is low (down to 500m). Lower density areas have longer
|
||
range masts, so the typical bleed will be high (up to 5,000m).
|
||
'''
|
||
if self.phone_density < 1:
|
||
return Polygons.approx_bleed_in_degrees * Polygons.approx_metres_to_degree
|
||
estimated_bleed = 5_900 - (math.log(self.phone_density, 10) * 1_250)
|
||
return max(500, min(estimated_bleed, 5000))
|
||
|
||
@property
|
||
def estimated_bleed_in_degrees(self):
|
||
return self.estimated_bleed_in_m / Polygons.approx_metres_to_degree
|
||
|
||
|
||
class BroadcastArea(BaseBroadcastArea, SortableMixin):
|
||
|
||
def __init__(self, row):
|
||
self.id, self.name, self._count_of_phones, self.library_id = row
|
||
|
||
@cached_property
|
||
def polygons(self):
|
||
return Polygons(
|
||
BroadcastAreasRepository().get_polygons_for_area(self.id)
|
||
)
|
||
|
||
@cached_property
|
||
def simple_polygons(self):
|
||
return Polygons(
|
||
BroadcastAreasRepository().get_simple_polygons_for_area(self.id)
|
||
)
|
||
|
||
@cached_property
|
||
def sub_areas(self):
|
||
return [
|
||
BroadcastArea(row)
|
||
for row in BroadcastAreasRepository().get_all_areas_for_group(self.id)
|
||
]
|
||
|
||
@property
|
||
def count_of_phones(self):
|
||
if self.id.endswith(CITY_OF_LONDON.WARDS):
|
||
return CITY_OF_LONDON.DAYTIME_POPULATION * (
|
||
self.polygons.estimated_area / CITY_OF_LONDON.AREA_SQUARE_MILES
|
||
)
|
||
if self.sub_areas:
|
||
return sum(area.count_of_phones for area in self.sub_areas)
|
||
# TODO: remove the `or 0` once missing data is fixed, see
|
||
# https://www.pivotaltracker.com/story/show/174837293
|
||
return self._count_of_phones or 0
|
||
|
||
@cached_property
|
||
def parents(self):
|
||
return list(filter(None, self._parents_iterator))
|
||
|
||
@property
|
||
def _parents_iterator(self):
|
||
id = self.id
|
||
|
||
while True:
|
||
parent = BroadcastAreasRepository().get_parent_for_area(id)
|
||
|
||
if not parent:
|
||
return None
|
||
|
||
parent_broadcast_area = BroadcastArea(parent)
|
||
|
||
yield parent_broadcast_area
|
||
|
||
id = parent_broadcast_area.id
|
||
|
||
|
||
class CustomBroadcastArea(BaseBroadcastArea):
|
||
|
||
def __init__(self, *, name, polygons=None):
|
||
self.name = name
|
||
self._polygons = polygons or []
|
||
|
||
@property
|
||
def polygons(self):
|
||
return Polygons(
|
||
# Polygons in the DB are stored with the coordinate pair
|
||
# order flipped – this flips them back again
|
||
Polygons(self._polygons).as_coordinate_pairs_lat_long
|
||
)
|
||
|
||
simple_polygons = polygons
|
||
|
||
@property
|
||
def overlapping_areas(self):
|
||
if not self.polygons:
|
||
return []
|
||
return broadcast_area_libraries.get_areas(
|
||
*rtree_index.intersection(self.polygons.bounds, objects='raw')
|
||
)
|
||
|
||
@cached_property
|
||
def count_of_phones(self):
|
||
return sum(
|
||
area.polygons.ratio_of_intersection_with(self.polygons) * area.count_of_phones
|
||
for area in self.overlapping_areas
|
||
)
|
||
|
||
|
||
class CustomBroadcastAreas(SerialisedModelCollection):
|
||
model = CustomBroadcastArea
|
||
|
||
def __init__(self, *, areas, polygons):
|
||
self.items = areas
|
||
self._polygons = polygons
|
||
|
||
def __getitem__(self, index):
|
||
return self.model(
|
||
name=self.items[index],
|
||
polygons=self._polygons if index == 0 else None,
|
||
)
|
||
|
||
|
||
class BroadcastAreaLibrary(SerialisedModelCollection, SortableMixin, GetItemByIdMixin):
|
||
|
||
model = BroadcastArea
|
||
|
||
def __init__(self, row):
|
||
id, name, name_singular, is_group = row
|
||
self.id = id
|
||
self.name = name
|
||
self.name_singular = name_singular
|
||
self.is_group = bool(is_group)
|
||
self.items = BroadcastAreasRepository().get_all_areas_for_library(self.id)
|
||
|
||
def get_examples(self):
|
||
# we show up to four things. three areas, then either a fourth area if there are exactly four, or "and X more".
|
||
areas_to_show = sorted(area.name for area in self)[:4]
|
||
|
||
count_of_areas_not_named = len(self.items) - 3
|
||
# if there's exactly one area not named, there are exactly four - we should just show all four.
|
||
if count_of_areas_not_named > 1:
|
||
areas_to_show = areas_to_show[:3] + [f'{count_of_areas_not_named} more…']
|
||
|
||
return formatted_list(areas_to_show, before_each='', after_each='')
|
||
|
||
|
||
class BroadcastAreaLibraries(SerialisedModelCollection, GetItemByIdMixin):
|
||
|
||
model = BroadcastAreaLibrary
|
||
|
||
def __init__(self):
|
||
self.items = BroadcastAreasRepository().get_libraries()
|
||
|
||
def get_areas(self, *area_ids):
|
||
# allow people to call `get_areas('a', 'b') or get_areas(['a', 'b'])`
|
||
if len(area_ids) == 1 and isinstance(area_ids[0], list):
|
||
area_ids = area_ids[0]
|
||
|
||
areas = BroadcastAreasRepository().get_areas(area_ids)
|
||
return [BroadcastArea(area) for area in areas]
|
||
|
||
|
||
broadcast_area_libraries = BroadcastAreaLibraries()
|