A new approach for automating land partitioning using binary search and Delaunay triangulation

One of the most important, yet time-consuming steps of the land consolidation process, which is related to pooling fragmented lands together, is the production of land partitioning plans. After the land redistribution process is finished, the land partitioning process begins. In that process, the locations of parcels within the blocks are determined. Due to the non-uniform geometric shapes of the blocks, the areas of the parcels cannot be divided directly. The production of an ideal land partitioning plan is not suitable automatically unless a quick, accurate process to divide the lands is secured. In this study, production of a pre-land partitioning plan is realized using both the binary search method and the Delaunay triangulation method, taking into consideration shape, size, value and road access criteria. The result of the experimental study shows that the proposed approach for dividing the parcels makes the process take place more quickly. Thus, a solid base for creating an automatic land partitioning plan-one that is closest to an ideal plan-will be provided with this study. (C) 2016 Elsevier B.V. All rights reserved.