JIPS (한국정보처리학회)
Current Result Document :
| 한글제목(Korean Title) |
A Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces |
| 영문제목(English Title) |
A Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces |
| 저자(Author) |
Liping Zhang
Song Li
Yingying Guo
Xiaohong Hao
|
| 원문수록처(Citation) |
VOL 16 NO. 02 PP. 0406 ~ 0420 (2020. 04) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.
|
| 키워드(Keyword) |
Line Segment k Nearest Neighbor
Line Segment Obstacle Distance
Line Segment Voronoi Diagram
Nearest Neighbor Query
Spatial Database
|
| 파일첨부 |
PDF 다운로드
|
