FF-SA: Fragmentation-free spatial allocation

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a grid G containing a set of orthogonal grid cells and a list L of choices on each grid cell (e.g., land use), the fragmentation-free spatial allocation (FF-SA) aims to find a tile-partition of G and choice assignment on each tile so that the overall benefit is maximized under a cost constraint as well as spatial geometric constraints (e.g., minimum tile area, shape). The spatial constraints are necessary to avoid fragmentation and maintain practicality of the spatial allocation result. The application domains include agricultural landscape design (a.k.a., Geodesign), urban land-use planning, building floor zoning, etc. The problem is computationally challenging as an APX-hard problem. Existing spatial allocation techniques either do not consider spatial constraints during space-tiling or are very limited in enumeration space. We propose a Hierarchical Fragmentation Elimination (HFE) algorithm to address the fragmentation issue and significantly increase the enumeration space of tiling schemes. The new algorithm was evaluated through a detailed case study on spatial allocation of agricultural lands in mid-western US, and the results showed improved solution quality compared to the existing work.

Cite

CITATION STYLE

APA

Xie, Y., & Shekhar, S. (2017). FF-SA: Fragmentation-free spatial allocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10411 LNCS, pp. 319–338). Springer Verlag. https://doi.org/10.1007/978-3-319-64367-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free