63 | | ○ In case source table containing only one point (constraint 1), converting source point to raster could utilize ST_AsRaster() to create a raster with the point geometry and raster specifications. |
64 | | ○ In case source table containing more than one point but the number of source points is small (constraint 5), computing distance could rescan all the source points and assign the shortest distance to the pixel being computed. |
| 63 | *In case source table containing only one point (constraint 1), converting source point to raster could utilize ST_AsRaster() to create a raster with the point geometry and raster specifications. |
| 64 | *In case source table containing more than one point but the number of source points is small (constraint 5), computing distance could rescan all the source points and assign the shortest distance to the pixel being computed. |
70 | | ○ Producing an intermediate raster is costly if the requested raster resolution is very high (constraint 3, 5b & 5d). |
71 | | ○ ST_Union could be very inefficient at producing the required raster from a large set of geometries and there is no efficient method to produce such a raster right now in PostGIS (constraints 1, 5c & 5d). |
72 | | ○ It could be very inefficient to rescan all the source points to find the one nearest to the current pixel (constraint 6, 7, 8 & 12). We still have to see how GRASS does this efficiently. |
73 | | ○ Only rasters which extent contains all the source points could be produced. |
74 | | ○ This approach does not answer well to the requirement of developing a generic reusable solution for more interpolation needs (constraint 7). |
| 70 | *Producing an intermediate raster is costly if the requested raster resolution is very high (constraint 3, 5b & 5d). |
| 71 | *ST_Union could be very inefficient at producing the required raster from a large set of geometries and there is no efficient method to produce such a raster right now in PostGIS (constraints 1, 5c & 5d). |
| 72 | *It could be very inefficient to rescan all the source points to find the one nearest to the current pixel (constraint 6, 7, 8 & 12). We still have to see how GRASS does this efficiently. |
| 73 | *Only rasters which extent contains all the source points could be produced. |
| 74 | *This approach does not answer well to the requirement of developing a generic reusable solution for more interpolation needs (constraint 7). |