원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
vol.2 no.2
2009.06
pp.1-10
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In this paper we propose an algorithm for exhaustive search of GIS Mobile query (pointin-area function). This algorithm search the status of a given co-ordinate point with respect to an area (described as a set of co-ordinates without any geometric relationship). In the exhaustive search algorithm proposed previously, there were a number of undetermined points (which does not support the range of scale), which are close to boundary co-ordinates. In this paper a new approach is introduced by which much accurate result can be obtained.
목차
Abstract
1. Introduction
2. Previous works
3. Our work
3.1. Data capture
3.2. Data integration
3.3. Projection and registration
3.4. Data structure
3.5. Data modeling
3.6. Algorithm for exhaustive search (Sum angle approach)
4. Result
5. Conclusion
References
1. Introduction
2. Previous works
3. Our work
3.1. Data capture
3.2. Data integration
3.3. Projection and registration
3.4. Data structure
3.5. Data modeling
3.6. Algorithm for exhaustive search (Sum angle approach)
4. Result
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보