<div dir="ltr"><div>Hi,</div><div><br></div><div>I've implemented a viewshed algorithm a while ago, by utilizing a modified version of the algorithm published at <a href="https://www.asprs.org/wp-content/uploads/pers/2000journal/january/2000_jan_87-90.pdf">https://www.asprs.org/wp-content/uploads/pers/2000journal/january/2000_jan_87-90.pdf</a></div><div><br></div><div>With this approach, it was crucial to provide a fast real-time option for the viewshed calculation on relatively large raster DEMs by using only a small memory footprint.</div><div><br></div><div>The implementation can be found here:</div><div><br></div><div><a href="https://github.com/szekerest/gdal/blob/viewshed/gdal/alg/viewshed.cpp">https://github.com/szekerest/gdal/blob/viewshed/gdal/alg/viewshed.cpp</a> </div><div><a href="https://github.com/szekerest/gdal/blob/viewshed/gdal/apps/gdal_viewshed.cpp">https://github.com/szekerest/gdal/blob/viewshed/gdal/apps/gdal_viewshed.cpp</a></div><div><br></div><div>Does it make sense to spend some more effort and incorporate this approach in GDAL officially?</div><div><br></div><div>Best regards,</div><div><br></div><div>Tamas</div><div><br></div><div> <br></div></div>