Abstract
From a single-attribute raster layer in which each cell is assigned a numerical value, a connected set of a specified number of cells that has the maximum (or minimum) total value is selected. This is a highly common decision problem in the context of raster-based geographic information systems (GIS) and seems general enough to deserve inclusion in the standard functionality of such systems. Yet it is a computationally difficult optimization problem, for which no efficient exact solution method has been found. This article presents a new dynamic programming-based heuristic method for the problem. Its performance is tested with randomly generated raster layers with various degrees of spatial autocorrelation. Results suggest that the proposed heuristic is a promising alternative to the existing integer programming-based exact method, as it can handle significantly larger raster data with fair accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Geographical Information Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
