altair slc voronoi partition area into polygons where all points more distant then central points
for graphic outut see (the minimum distance is the perpendicular cord from the cental point to the boundary)
https://github.com/rogerjdeangelis/utl-altair-slc-voronoi-partition-area-into-polygons-where-all-points-more-distant-then-central-point/blob/main/voronoi_parallelogram.pdf
too long to post on a list, see github
https://github.com/rogerjdeangelis/utl-altair-slc-voronoi-partition-area-into-polygons-where-all-points-more-distant-then-central-point
related repo
https://github.com/rogerjdeangelis/utl_voronoi_diagram_on_a_shapefile_of_singapore
NOTES
http://mathworld.wolfram.com/VoronoiDiagram.html
The partitioning of a plane with n points into convex polygons such that each polygon contains
exactly one generating point and every point in a given polygon is closer to its
generating point than to any other. A Voronoi diagram is sometimes also known as a Dirichlet
tessellation. The cells are called Dirichlet regions, Thiessen polytopes, or Voronoi polygons.
A particularly notable use of a Voronoi diagram was
the analysis of the 1854 cholera epidemic in London, in which physician John Snow
determined a strong correlation of deaths with proximity to a
particular (and infected) water pump on Broad Street.
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on
distance to points in a specific subset of the plane. ... These regions are called Voronoi cells.
The Voronoi diagram of a set of points is dual to its Delaunay triangulation.
They find widespread applications in areas such as computer graphics, epidemiology,
geophysics, and meteorology.
see
https://stackoverflow.com/questions/50979999/delimit-voronoi-diagram-with-map-boundary-in-r
Robert Hijmans profile
https://stackoverflow.com/users/635245/robert-hijmans
