METHOD FOR SEARCHING CROSS POINT OF POLY-LINE USING DIVISION OF POLY-LINE

摘要

PURPOSE: A method for searching a cross point of a poly-line using division of the poly-line is provided to improve a performance of a space database management system by sorting each vertex using division of a poly-line for searching cross points. CONSTITUTION: A poly-line A and a poly-line B are divided and sorted(401,402). Minimum points of the poly-line A are existed in an aggregation(Am), and minimum points of the poly-line B are existed in an aggregation(Bm). Minimum values among elements of aggregations(Am,Bm) are inserted into aggregations(Ac,Bc)(403). An aggregation(An) composed as elements of the aggregation(Am) which is less than end point of each element of the aggregation(Bc) is generated(404). An aggregation(Bn) composed as elements of the aggregation(Bm) which is less than end point of each element of the aggregation(Ac) is generated(404). Cross points with elements of aggregations(Bc,Ac) are searched in aggregations(An,Bn)(406). Aggregations(Ac,Bc) are changed as a next minimum value(407).