Earticle

초록

영어

Visibility research, calculating LOS and viewshed is one of the most important paradigms of the GIS. As increasingly large-scale data have become available the volume of these datasets reveals scalability problems with existing GIS algorithms. To solve this problem, a kind of serial algorithm was developed to generate viewshed on large DEMs. This paper divided the whole DEM into rectangular blocks in row and column directions, the processed these blocks with four axes followed by four sectors sequentially for selection of LCPs Using viewsheds analysis. When processing the particular block, we use the reference plane method to calculate the visibility of the target point on the block, and adjusted the calculation sequence according to the different spatial relationships between the block and the viewpoint since the viewpoint is not always inside the DEM. By using reference Plane method and using a block partitioning method to segment and load the DEM dynamically, it is possible to analysis viewshed efficiently. Experiments showed that overcome the limit of commercial GIS software and suggested retains the accuracy of the reference plane method and has near linear computer complexity.

목차

ABSTRACT
 I. 서론
  1. 연구의 배경 및 목적
  2 연구의 범위 및 방법
 II. 이론적 고찰
  1. 경관시뮬레이션
  2. 가시한계분석
 III. 가시한계분석을 통한 경관통제점 선정 절차 도출
  1. 일반적 경관통제점 선정 방법의 문제점
  2 가시한계분석의 기술적 고려
 IV. 적용 및 검토
  1. 사례대상지 개요
  2 경관통제점의 선정 및 평가
 IV. 결론
 ❚참고문헌

저자

• 이승엽 [ Lee, Seung-Yeob | 경주대학교 건축학부 조교수 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  경주연구

• 간기

  반년간

• pISSN

  1975-2482

• 수록기간

  1992~2016

• 십진분류

  KDC 912 DDC 951