Abstract
An algorithm for nearest neighbor query of Line Segment based on the R*S-tree is proposed. The dynamic spatial indexing structure for spatial line segments was constructed based on the R*S-tree, and the k-nearest neighbor of the target line segment were obtained by the hollow ball. The distance between the target line segment and the neighbor line segments was computed, and the neighbor line segments were sorted by the distance. The result shows that the algorithm can obtain nearest neighbor line segment accurately and effectively and has the strong adaptability of data type.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
