Buffer Analysis Parallel Optimized Algorithm of Vector Data Based on Plane Graph Model
-
- 발행기관
- 보안공학연구지원센터(IJGDC) 바로가기
-
- 간행물
- International Journal of Grid and Distributed Computing SCOPUS 바로가기
-
- 통권
- Vol.9 No.12 (2016.12)바로가기
-
- 페이지
- pp.35-50
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A297046
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- In order to solve the efficiency of buffer analysis of line elements, adopt plane graph model and according to the characteristic of simple feature model, making the bounding-edges of the line elements into plane graph model, then According to certain rules to filter the lines of plane graph model to gain the bounding edges of buffer and then gain the results. In this algorithm, firstly, As required, do parallel lines and polylines vertex processing for the line elements extracted from the objects which need buffer analysis , and gain the Intermediate line objects, then Generate line elements of graph model through computing intersecting points and clip lines using static R tree index, Moreover using the multiple programming standard OPENMP, Optimize the parallelism of every step of the vector buffer analysis algorithm, This algorithm can solve buffer efficient of large data and it’s is better than other algorithm in physical problem.
목차
Abstract
1. Introduction
2. Related Concepts
2.1 Planar Graph and Topological Position
2.2 Algorithm Data Structure
3. Lite Design and Implementation of Algorithms
3.1 Line Elements Atomic Boundary Contour Calculation
3.2 The Intersection of Computing and Contour cut
3.3 Chart and Sub Graph Generation
3.4 The Results of Calculation of Polygon Boundary
3.5 The Results of Polygons Calculation
4. Parallel Optimization Analysis
4.1 Boundary Contour Line Features Atoms Parallel Optimization Calculation Steps
4.2 Contour Point Calculations and Cut Steps Parallel Optimization
4.3 Graph and Sub-graph Generation Steps Parallel Optimization
4.4 The Results Calculating of Polygon Boundary
4.5 Parallel Optimization Step Results Polygon
5. Algorithm Analysis And Test Results
6. Summary
References
키워드
Simple feature model Buffer analysis Plane graph model Parallel Optimization저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Grid and Distributed Computing
- 간기
- 격월간
- pISSN
- 2005-4262
- 수록기간
- 2008~2016
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.9 No.12
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
0개의 논문이 장바구니에 담겼습니다.