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

Basit Öğe Kaydı
dc.contributor.authorHakli, Huseyin
dc.contributor.authorUguz, Harun
dc.contributor.authorCay, Tayfun
dc.date.accessioned2020-03-26T19:22:56Z
dc.date.available2020-03-26T19:22:56Z
dc.date.issued2016
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractOne 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.en_US
dc.description.sponsorshipScientific Research Project of Selcuk UniversitySelcuk University; Project of the Scientific and Technological Research Council of Turkey (TUBITAK) [2140015]en_US
dc.description.sponsorshipThis study has been supported by the Scientific Research Project of Selcuk University and the No. 2140015 Project of the Scientific and Technological Research Council of Turkey (TUBITAK).en_US
dc.identifier.doi10.1016/j.compag.2016.05.006en_US
dc.identifier.endpage136en_US
dc.identifier.issn0168-1699en_US
dc.identifier.issn1872-7107en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage129en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.compag.2016.05.006
dc.identifier.urihttps://hdl.handle.net/20.500.12395/33182
dc.identifier.volume125en_US
dc.identifier.wosWOS:000378191300014en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER SCI LTDen_US
dc.relation.ispartofCOMPUTERS AND ELECTRONICS IN AGRICULTUREen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectLand consolidationen_US
dc.subjectAutomatic land partitioningen_US
dc.subjectBinary searchen_US
dc.subjectTriangulationen_US
dc.titleA new approach for automating land partitioning using binary search and Delaunay triangulationen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu