Earticle

현재 위치 Home

Automatic Polygonization Algorithm on Parallel and Graph Model

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJHIT) 바로가기
  • 간행물
    International Journal of Hybrid Information Technology 바로가기
  • 통권
    Vol.9 No.5 (2016.05)바로가기
  • 페이지
    pp.21-30
  • 저자
    Liang Wu, Zhanlong Chen, Min Hao, Zhong Xie
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A275323

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
The polygon construction is the emphasis and difficulty for constructing the topological relationship of spatial data. Many scholars continuous study and innovate for the algorithm. The traditional computational process mainly involves three steps in algorithms: (1) Determining the relationship between adjacent arcs. (2) Searching polygons. (3) Determining the topological relationship between arcs and polygons. With the increase of the number of data and the need to improve the automatization, speed and complexity of algorithm, the serial algorithm has become more and more difficult in polygon construction and is often more time consuming. The algorithm of polygon construction is meeting challenge with the development of computer technology. When processing the large-scale linear data, an efficient strategy to reduce the time of complex operations in algorithm has not been proposed in spatial data field. We propose a novel algorithm to construct polygons automatically in the parallel environment base on the new IT technology. The key of the algorithm is paralleling the more time consuming operation (search, sort. etc.) and improving the speed of polygon construction. According to the characteristics of directed rings in graph model, we construct topological polygons. The experimental results on multicore computers show that the algorithm is efficient parallel performance for polygon construction.

목차

Abstract
 1. Introduction
 2. Parallel Computing Model and Intersection Calculation for Line Segments
 3. Parallel Construction
  3.1. Record Relationships between Edges
  3.2. The Calculation of the Result Polygons
  3.3. Generate a Valid Ring
 4. Experiments
 5. Discussion
 6. Conclusion
 References

키워드

graph model polygonization parallel computing

저자

  • Liang Wu [ College of Information Engineering, China University of Geosciences, Wuhan, 430074, China, National Engineering Research Center for GIS, Wuhan, 430074, China ]
  • Zhanlong Chen [ College of Information Engineering, China University of Geosciences, Wuhan, 430074, China ]
  • Min Hao [ College of Information Engineering, China University of Geosciences, Wuhan, 430074, China ]
  • Zhong Xie [ College of Information Engineering, China University of Geosciences, Wuhan, 430074, China, National Engineering Research Center for GIS, Wuhan, 430074, China, College of Information Engineering, China University of Geosciences, Wuhan, 430074, China ] Corresponding Author

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Hybrid Information Technology
  • 간기
    격월간
  • pISSN
    1738-9968
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.9 No.5

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장