Automatic extraction of the polygon obtained by the intersection of parcels with the geometric algorithms

Abstract

Today, many mapping techniques (development plan implementation, expropriation, urban and rural arrangement, etc.) are applied geometrically. One of the situations that will be encountered in these applications is the relative status of the parcels. Firstly, point-plot relationships for arbitrary points were examined in this study. It was investigated whether these points were inside or outside the parcel. The aim is to determine the positions of the points relative to the parcels and to observe whether there is an intersection. If there is an intersection between the main parcel and the test parcel as a result of the point-parcel examination, the intersection points of these two parcels are found. Parcel corner points and intersection points are ordered according to the specified criteria and the intersection parcel is obtained. The area of the intersection parcel obtained is calculated. All possible special cases of the two parcels are examined relative to each other. With the proposed method, the results for each of the special cases are obtained and presented. The accuracy of the results was compared with CAD and GIS software and their advantages and disadvantages were examined. The proposed method is designed to be two or more parcels in many surveying techniques and gives high accuracy results. In addition, it is foreseen that the proposed method will provide great convenience in calculations functionally and temporally.

Keywords

• Mapping techniques
• Point – parcel relations
• GIS software

References

1. Barsky B A & Liang Y D (1984). A New Concept and Method for Line Clipping, ACM Transactions on Graphics, 3(1), 1–22.
2. Cyrus M & Beck J (1978). Generalized Two- and Three-Dimensional Clipping, Computers &Graphics, 3(1), 23–28.
3. Day J D (1992). A New Two-Dimensional Line Clipping Algorithm for Small Windows, Computer Graphics Forum, 11(4), 241–245.
4. Greiner G & Hormann K (1998). Efficient Clipping of Arbitrary Polygons, ACM Transactions on Graphics, 17(2), 71–83.
5. Huang C W & Shih T Y (1997). On The Complexity of Point-in-Polygon Algorithms, Computers & Geosciences, 23(1), 109-118.
6. Huang Y Q & Liu Y K (2002). An Algorithm for Line Clipping against a Polygon Based on Shearing Transformation, Computer Graphics Forum, 21(4), 683–688.
7. Jianqiang H, Jianzhi S, Yi C, Qiang C & Li T (2018). Tan Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons Symmetry, 10, 477-503.
8. Kitay M G (1985). Land Acquisitionin Developing Countries, Lincolh İnstitue, Boston, Usa.

9. Maillot P G (1992). A New, Fast Method for 2D Polygon Clipping: Analysis and Software Implementation, ACM Transactions on Graphics, 11(3), 276–290.
10. Möller T (1997). A Fast Triangle-Triangle Intersection Test, Journal of Graphics Tools, 2(2), 25–30.
11. Nicholl T M, Lee D T & Nicholl R A (1987). An Efficient New Algorithm for 2-D Line Clipping: Its Development and Analysis, ACM SIGGRAPH Computer Graphics, 21(4), 253–262.
12. Taylor G (1994). Point in Poligon Test, Survey Review, 32(254), 479-484.
13. Sutherland I E & Hodgman G W (1974). Reentrant Polygon Clipping, Communications of the ACM, 17(1), 32–42.
14. Weiler K & Atherton P (1977). Hidden surface removal using polygon area sorting, ACM SIGGRAPH Computer Graphics, 11(2), 214–222.
15. Yanalak M & İpbüker C (2003). Hesaplamalı Geometri, Harita Dergisi, 129, 50-62.
16. Yomralıoğlu T (2000). Coğrafi Bilgi Sistemleri: Temel Kavramlar ve Uygulamaları, 5.Baskı (2009), s.480, ISBN 975-97369-0-X, İstanbul.