KR20150097972A - Uncertain boundary detecting system of cadastral data and method thereof - Google Patents
Uncertain boundary detecting system of cadastral data and method thereof Download PDFInfo
- Publication number
- KR20150097972A KR20150097972A KR1020140018912A KR20140018912A KR20150097972A KR 20150097972 A KR20150097972 A KR 20150097972A KR 1020140018912 A KR1020140018912 A KR 1020140018912A KR 20140018912 A KR20140018912 A KR 20140018912A KR 20150097972 A KR20150097972 A KR 20150097972A
- Authority
- KR
- South Korea
- Prior art keywords
- region
- triangles
- uncertain
- detecting
- tagging
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
The present invention relates to a system and method for detecting uncertain regions of cadastral data, the system according to the present invention is an uncertain region detection system for detecting uncertain regions of parcels represented by polygons in cadastral data, A triangulation unit for performing Constrained Delaunay Triangulation (CDT) with respect to the edge of the polygon object as a reference point for triangulation of the vertex of the polygon object; A tagging unit for tagging each of the triangles with the number of the divided triangles to overlap each other; And a detection unit for detecting the uncertain region based on the tagged value. Through this, it is possible to efficiently detect an uncertain region where there is a gap between polygon sets or overlapping by applying a space division technique.
Description
The present invention relates to an uncertain region detection system and method for intelligent data, and more particularly, to a system and method for detecting redundant regions and blank regions that occur due to inadequate proximity of a polygon boundary to surrounding polygons in intelligent data And a method thereof.
The cadastre is a content that notifies the location, form, area, use, and ownership of the land. The bounded boundary constitutes one parcel, and the shape of each parcel is expressed using a polygon. At this time, the neighboring polygons must be precisely adjacent to each other, and the topology integrity must be ensured so that they do not overlap each other or have no spaces.
However, in the process of digitization of cadastral maps, including the relaxation and contraction of intellectual circles that have been stored for a long time in the cadastre library, errors arising in vectorizing cadastral maps, problems of differences in surveying due to the use of different reference points, The cognitive data set has a topological contradiction due to various factors such as the transfer of numerical errors when applied to the server. This phenomenon occurs more frequently if not stored / managed through a centralized intellectual database.
The most basic method for constructing a consistent topological database is to re-survey uncertain areas of intellectual in one institution and to integrate management of global cadastral data for topological integrity . However, the above process is difficult to be realized within a short period of time and it is difficult to realistically realize it because it requires a lot of financial investment.
Therefore, many studies have been conducted to derive a solution for checking / detecting the topological integrity. Many methods have been developed to use approximate threshold values around polygon boundaries in order to find adjacent objects as a result. One of the results of this study is the Sweep Band Status (SBS) method (Klajnsek, G. and Zalik, B. (2005), Merging polygons with uncertain boundaries. Computers & Geosciences, Vol.31, No.3, pp.353- 359) have been proposed. This method computes the distance from a specific point p to the other edge, and classifies it as an uncertain region if the calculated distance is smaller than a predetermined threshold distance. According to this method, since the user has to repeatedly check the result while adjusting the threshold value according to the result, there is a problem that the uncertain region which is troublesome and is missed according to the applied threshold value occurs.
The applicant of the present invention has solved the problems of the prior art as described above and proposed a detection system capable of preventing omission of an uncertain region and improving the reliability of the result even after a simple process.
SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems, and it is an object of the present invention to provide a detection system and method which can prevent detection of an uncertain region in cadastral data and improve the reliability of the detection result.
According to an aspect of the present invention, there is provided an uncertain region detection system for detecting uncertain regions of parcels expressed by polygons in cadastral data according to an embodiment of the present invention, A triangulation performing unit that performs constrained delaunay triangulation (CDT) on the edge of the polygon object as a restriction condition; A tagging unit for tagging each of the triangles with the number of the divided triangles to overlap each other; And a detection unit for detecting the uncertain region on the basis of the tagged value.
The detection unit may detect a triangular area having the tagged value of 0 or greater than 1 as the uncertain area, and the detection unit may set the triangular area having the tagged value of 0 as a blank area, The uncertainty region can be distinguished from the triangular region larger than 1 by the overlap region.
The detecting unit may combine neighboring triangles having the same tagged value and connectivity among the triangles detected as the uncertain region.
According to another aspect of the present invention, there is provided a method of detecting an uncertain region of parcels expressed by polygons in a cognitive data, the method comprising the steps of: (a) recognizing vertices and edges of a polygon object constituting the cadastral data ; (b) performing constrained delaunay triangulation (CDT) on the cadastral data with the recognized vertex as a reference point of triangle generation and with the edge as a constraint; (c) tagging the number of triangles of the triangles by the triangles; And (d) detecting an uncertain region based on the tagged value. ≪ Desc /
In this case, the step (d) may detect the uncertain region as a triangle having a tagged value of 0 as a blank region and a triangular region having a tagged value greater than 1 as an overlapped region, (e) Merging neighboring triangles having the same tagged value and connectivity among the triangles detected as the regions.
As described above, according to the present invention, it is possible to efficiently detect an uncertain region in which spaces between polygon objects exist or overlap by applying a space division technique.
1 is a block diagram of an uncertain region detection system of cadastral data according to an embodiment of the present invention;
2 is a reference diagram for explaining the Neuron triangulation;
FIG. 3 is a side view for explaining a limited overhead triangulation; FIG.
FIG. 4 is a flowchart illustrating a process of detecting an uncertain region of cadastral data by the system of FIG. 1; FIG.
Figure 5 is an example showing the result of performing limited overtone triangulation on a piece of cadastral data;
6 is an example showing the result of performing tagging on the divided triangles; And
7 is a diagram schematically illustrating an example of region merging according to a tagging value.
The uncertain region described in this specification includes a blank area (gaps) that is not adjacent to overlaps where polygon objects constituting parcels of intellectual data overlap with each other and which is blank.
Hereinafter, specific embodiments of the present invention will be described with reference to the drawings.
1 is a block diagram of an uncertain region detection system of cadastral data according to an embodiment of the present invention. Referring to FIG. 1, an uncertain region detection system of cadastral data according to an embodiment of the present invention includes a
The
Fig. 2 is a perspective drawing for explaining the Neuron triangulation, and Fig. 3 is a view for explaining the restricted Neuron triangulation.
The trine triangulation is a method of dividing the space by connecting the points on the plane with triangles so that the minimum value of the interior angles of these triangles is maximized. As shown in FIG. 2 (a), a method of connecting the upper points may be variously described. However, according to the Amore triangulation, And the circumscribed circle of any triangle is divided so that it does not include any other points except the three vertexes of the triangle.
The constrained threesome triangulation is a segmentation technique that adds constraints to the above triangulation. According to this, the area where the triangles can be generated is divided into lines, and the triangles generated as the restriction condition are divided so as not to exceed the lines given above. When a constrained circumferential triangulation is performed in a situation where a thick line is given as a constraint condition as shown in FIG. 3 (a), it is divided into a triangle that does not exceed the line of the constraint condition as shown in FIG. 3 (b). In this way, the triangulation method is a known method of dividing a given space into triangles under the constraint that the triangulation region is limited to a line. Therefore, the description will be omitted for the sake of simplicity.
The
The
The
The
FIG. 4 is a flowchart illustrating a process of detecting an uncertain region of cadastral data by the system of FIG. 1, and FIGS. 5 to 7 are diagrams illustrating a process of detecting an uncertain region. Hereinafter, a method of detecting an uncertain region of cadastral data according to an embodiment of the present invention will be described with reference to FIGS. 4 to 7. FIG.
The vertex and the edge are recognized in the polygon object constituting the parcel of the cadastral data, and limited delineated triangulation is performed on the cadastral data (S10, S11). At this time, the vertex of the recognized polygon becomes a reference point of triangle generation in the triangulation, and the edge of the polygon is applied as a restriction condition.
FIG. 5 (b) is a graphical representation of the result of performing the limited perone triangulation on the polygon objects of a given cadastral data as shown in (a). Thus, the triangulation is performed for a given area including the inside and outside of the polygon boundary. For reference, (a) is an example of intellectual data including two polygon objects. In order to facilitate understanding of the explanation, the markings inside each polygon object are expressed differently.
When the triangulation is completed, the number of triangles to be superimposed on each other is determined while circulating the divided triangles, and the number is added to the corresponding triangles as a tagging value (S13). Fig. 6 schematically shows the result of assigning a tagging value to each of the divided triangles. Referring to FIG. 6, a triangle belonging to a single polygon is given a tagging value of 1 as a topological integrity region, a portion where two polygon regions overlap is a tagging
S15 is an uncertain region extracted by merging neighboring triangles having tagging values equal to or greater than 0 and greater than or equal to 1 and having connectivity. Referring to FIG. 7, it can be seen that an area having a tagging value of 0 and an area having a tagging value of 2 are displayed separately. In this case, in order to easily distinguish the shape of the uncertain area, markings may be displayed differently depending on the tagging value or the overlap area / blank area.
The above-described process may be appropriately added or modified depending on the situation. For example, the step of receiving the census data to be analyzed from an external server may be further included, or the topological integrity area may not be re-surveyed or changed. Therefore, before performing the merge of triangles, The value may further include a step of removing.
As can be seen from the above description, the uncertain region detection system of the cadastral data according to the embodiment of the present invention can detect an uncertain region where the detection is missed by the conventional manual method or the method using the threshold value, And the time required for processing can be shortened by eliminating the cumbersome process of repeatedly changing the threshold value according to the method using the threshold value.
While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art to which the invention pertains. It will be possible.
For example, a user interface may be constructed to provide a function of selectively displaying an area requested by a system user such as an area display having a specific tagging value and an uncertain area display exceeding a predetermined area.
Therefore, it is to be understood that the embodiments of the present invention are to be considered as illustrative only, and that the technical spirit of the present invention is defined from the description of the claims, and the scope of protection is to be applied to the equivalents.
10: triangular division performing unit 30: tagging unit
50:
Claims (7)
A triangulation unit for performing Constrained Delaunay Triangulation (CDT) with respect to the cadastral data with a vertex of the polygon object as a reference point for triangle creation, with the edge of the polygon object as a restriction condition;
A tagging unit for tagging each of the triangles with the number of the divided triangles to overlap each other; And
And a detection unit for detecting the uncertain region based on the tagged value.
Wherein the detecting unit detects an area of a triangle having the tagged value of 0 or greater than 1 as the uncertain area.
Wherein the detection unit distinguishes the uncertain region from the triangular region having the tagged value of 0 as a blank region and the triangular region having the tagged value greater than 1 as an overlap region.
Wherein the detecting unit merges neighboring triangles having the same tagged value and connectivity among the triangles detected as the uncertain region.
(a) recognizing vertexes and edges of a polygon object constituting the cadastral data;
(b) performing constrained delaunay triangulation (CDT) on the cadastral data with the recognized vertex as a reference point of triangle generation and with the edge as a constraint;
(c) tagging the number of triangles of the triangles by the triangles; And
(d) detecting an uncertain region based on the tagged value.
Wherein the step (d) detects the uncertain region by using the triangular region having the tagged value of 0 as a blank region and the triangular region having the tagged value of greater than 1 as overlapping regions.
(e) merging adjacent triangles having the same tagged value and connectivity, among the triangles detected as the uncertain region. < Desc / Clms Page number 13 >
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020140018912A KR101555989B1 (en) | 2014-02-19 | 2014-02-19 | Uncertain boundary detecting system of cadastral data and method thereof |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020140018912A KR101555989B1 (en) | 2014-02-19 | 2014-02-19 | Uncertain boundary detecting system of cadastral data and method thereof |
Publications (2)
Publication Number | Publication Date |
---|---|
KR20150097972A true KR20150097972A (en) | 2015-08-27 |
KR101555989B1 KR101555989B1 (en) | 2015-09-30 |
Family
ID=54059526
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
KR1020140018912A KR101555989B1 (en) | 2014-02-19 | 2014-02-19 | Uncertain boundary detecting system of cadastral data and method thereof |
Country Status (1)
Country | Link |
---|---|
KR (1) | KR101555989B1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110689569A (en) * | 2019-12-10 | 2020-01-14 | 北京唯智佳辰科技发展有限责任公司 | Integrated circuit layout field identification and grid subdivision processing method and device |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100491723B1 (en) | 2001-12-20 | 2005-05-27 | 한국전자통신연구원 | Method of rendering a digital terrain model in geographic information system |
KR101063827B1 (en) | 2009-04-27 | 2011-09-08 | 건국대학교 산학협력단 | Semi-automated Conjugated Point Pair Extraction Method for Transformation of Geometric Maps between Continuous and Digital Topographic Maps |
-
2014
- 2014-02-19 KR KR1020140018912A patent/KR101555989B1/en active IP Right Grant
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110689569A (en) * | 2019-12-10 | 2020-01-14 | 北京唯智佳辰科技发展有限责任公司 | Integrated circuit layout field identification and grid subdivision processing method and device |
CN110689569B (en) * | 2019-12-10 | 2020-06-30 | 北京唯智佳辰科技发展有限责任公司 | Integrated circuit layout field identification and grid subdivision processing method and device |
Also Published As
Publication number | Publication date |
---|---|
KR101555989B1 (en) | 2015-09-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11709058B2 (en) | Path planning method and device and mobile device | |
Riveiro et al. | Automated processing of large point clouds for structural health monitoring of masonry arch bridges | |
US20150254499A1 (en) | Multi-view 3d object recognition from a point cloud and change detection | |
Cheng et al. | Modeling tower crane operator visibility to minimize the risk of limited situational awareness | |
CN102136155B (en) | Object elevation vectorization method and system based on three dimensional laser scanning | |
JP6131704B2 (en) | Detection method for continuous road segment and detection device for continuous road segment | |
US9367737B2 (en) | Floor plan space detection | |
CN108629228B (en) | Road object identification method and device | |
Akula et al. | Real-time drill monitoring and control using building information models augmented with 3D imaging data | |
CN110404261B (en) | Method and device for constructing virtual road network in game | |
CN101719127A (en) | Quick systemic checking method of data quality of geological and mineral spatial database | |
CN111291603A (en) | Lane line detection method, device, system and storage medium | |
CN103817938A (en) | Rapid bridging method of polygonal area containing plurality of holes | |
US9910878B2 (en) | Methods for processing within-distance queries | |
CN111308500A (en) | Obstacle sensing method and device based on single-line laser radar and computer terminal | |
CN105404898A (en) | Loose-type point cloud data segmentation method and device | |
CN110489511B (en) | Contour line edge-contact elevation error correction method and system, electronic device and medium | |
CN114818065A (en) | Three-dimensional roadway model building method and device, electronic equipment and storage medium | |
Liu et al. | An adaptive approach for primitive shape extraction from point clouds | |
CA3037575A1 (en) | Geometric modelling for facilitating simulation for manufacturing operations | |
KR101555989B1 (en) | Uncertain boundary detecting system of cadastral data and method thereof | |
CN103065306B (en) | The disposal route of graph data and device | |
CN103093475A (en) | Image processing method and electronic device | |
WO2023179382A1 (en) | Method and apparatus for marking obstacle in robot map | |
CN111881752A (en) | Guardrail detection and classification method and device, electronic equipment and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A201 | Request for examination | ||
E902 | Notification of reason for refusal | ||
E701 | Decision to grant or registration of patent right | ||
GRNT | Written decision to grant | ||
FPAY | Annual fee payment |
Payment date: 20180820 Year of fee payment: 4 |
|
FPAY | Annual fee payment |
Payment date: 20190902 Year of fee payment: 5 |