Tạp chí Khoa học và Công Nghệ, T. 49, S. 5 (2011)

Cỡ chữ:  Nhỏ  Vừa  Lớn

A Simple Algorithm for Finding Fast, Exactly Tiles Intersect with Polygons

Nam Nguyen Vinh Nam Nguyen Vinh, Nam Nguyen Minh Nam Nguyen Minh, Bac Le Hoai Bac Le Hoai

Tóm tắt

In this article, we present a simple algorithm that allows us to find tiles intersect quickly and precisely with a given polygon. This is the one of important tasks in maintaining tile system for Web Map services today. In this study, 75% of tiles can be successfully saved by use of our newly developed method as compared with the conventional Minimum Bounding Rectangle method when applying for administrative regions of Vietnam. In addition, this algorithm is simple and easy to implement.

Toàn văn: PDF

Tạp chí Khoa học và Công Nghệ / Journal of Science and Technology ISSN: 0866 708X

VietnamJOL is supported by INASP