This module contains functions that computes new geographies by processing existing geographies.
ST_DELAUNAYLINES
ST_DELAUNAYLINES(points)
Description
Calculates the Delaunay triangulation of the points provided. An array of linestrings in GeoJSON format is returned.
points: ARRAY array of points in GeoJSON format casted to STRING.
Due to technical limitations of the underlying libraries used, the input points' coordinates are truncated to 5 decimal places in order to avoid problems that happen with close but distinct input points. This limits the precision of the results and can alter slightly the position of the resulting polygons (about 1 meter). This can also result in some points being merged together, so that fewer polygons than expected may result.
warning
The maximum number of points typically used to compute Delaunay diagrams is 300,000. This limit ensures efficient computation while maintaining accuracy in delineating regions based on proximity to specified points.
Note that if some points are very close together (about 1 meter) they may be merged and the result may have fewer lines than expected, for example these four points result in two lines:
Calculates the Delaunay triangulation of the points provided. An array of polygons in GeoJSON format is returned.
points: ARRAY array of points in GeoJSON format casted to STRING.
Due to technical limitations of the underlying libraries used, the input points' coordinates are truncated to 5 decimal places in order to avoid problems that happen with close but distinct input points. This limits the precision of the results and can alter slightly the position of the resulting polygons (about 1 meter). This can also result in some points being merged together, so that fewer polygons than expected may result.
warning
The maximum number of points typically used to compute Delaunay diagrams is 300,000. This limit ensures efficient computation while maintaining accuracy in delineating regions based on proximity to specified points.
Note that if some points are very close together (about 1 meter) they may be merged and the result may have fewer triangles than expected, for example these four points result in one triangle:
Calculates the Voronoi diagram of the points provided. An array of linestrings in GeoJSON format is returned.
points: ARRAY array of points in GeoJSON format casted to STRING.
bbox (optional): ARRAY clipping bounding box. By default the [-180,-85,180,85] bbox will be used.
Due to technical limitations of the underlying libraries used, the input points' coordinates are truncated to 5 decimal places in order to avoid problems that happen with close but distinct input points. This limits the precision of the results and can alter slightly the position of the resulting lines (about 1 meter). This can also result in some points being merged together, so that fewer lines than input points may result.
warning
The maximum number of points typically used to compute Voronoi diagrams is 300,000. This limit ensures efficient computation while maintaining accuracy in delineating regions based on proximity to specified points.
Note that if some points are very close together (about 1 meter) they may be merged and the result may have fewer lines than points, for example these three points result in two lines
Calculates the Voronoi diagram of the points provided. An array of polygons in GeoJSON format is returned.
points: ARRAY array of points in GeoJSON format casted to STRING.
bbox (optional): ARRAY clipping bounding box. By default the [-180,-85,180,85] bbox will be used.
Due to technical limitations of the underlying libraries used, the input points' coordinates are truncated to 5 decimal places in order to avoid problems that happen with close but distinct input points. This limits the precision of the results and can alter slightly the position of the resulting polygons (about 1 meter). This can also result in some points being merged together, so that fewer polygons than input points may result.
warning
The maximum number of points typically used to compute Voronoi diagrams is 300,000. This limit ensures efficient computation while maintaining accuracy in delineating regions based on proximity to specified points.
Note that if some points are very close together (about 1 meter) they may be merged and the result may have fewer polygons than points, for example these three points result in two polygons:
