• Title/Summary/Keyword: 잠재적가시공간

Search Result 4, Processing Time 0.018 seconds

An Improvement Method of Indoor Rendering Speed Using BSP and PVS Algorithms (이진공간분할(BSP)과 잠재적가시공간(PVS) 알고리즘을 이용한 실내렌더링 속도개선 방법)

  • Kim, Byoung-Sun;Kwon, Soon-Kak;Kim, Seong-Woo;Lee, Jung-Hwa;Jung, Jai-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.88-95
    • /
    • 2008
  • In this paper, we present an efficient indoor rendering method using BSP(Binary Space Partitioning) and PVS(Potentially Visible Space) algorithms. The proposed method displays efficiently the objects by including the objects in the process of separating the number of BSP area, by jointly using BSP and PVS algorithms. Also, the screen which is checked by PVS from player's location is displayed. From the simulation, we can see that the proposed method improves the rendering speed because of processing the objects with the edges of BSP and PVS.

  • PDF

Hardware-based Visibility Preprocessing using a Point Sampling Method (점 샘플링 방법을 이용한 하드웨어 기반 가시성 전처리 알고리즘)

  • Kim, Jaeho;Wohn, Kwangyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.8 no.2
    • /
    • pp.9-14
    • /
    • 2002
  • In cases of densely occluded urban scenes, it is effective to determine the visibility of scenes, since only small parts of the scene are visible from a given cell. In this paper, we introduce a new visibility preprocessing method that efficiently computes potentially visible objects for volumetric cells. The proposed method deals with general 3D polygonal models and invisible objects jointly blocked by multiple occluders. The proposed approach decomposes volume visibility into a set of point visibilities, and then computes point visibility using hardware visibility queries, in particular HP_occlusion_test and NV_occlusion_query. We carry out experiments on various large-scale scenes, and show the performance of our algorithm.

  • PDF

Factor Analysis for Improvement of Convenience and Safety in the Interior Design of Subway Trains (지하철 차량 실내디자인의 편의성과 안전성 증진요소 분석)

  • Jin, Mi-Ja;Han, Suk-Woo
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.6
    • /
    • pp.779-785
    • /
    • 2007
  • This study identifies visible/invisible factors and analyzes facilities, structure, and visible perceptive contents in the aspects of operation and efficiency with a focus on the interfaces between interior design of the subway and users. More specifically, it diagnoses the requirements and empirically presents improvements. As the interior design in the subway trains is fur the public reflecting the value, consciousness, and behaviors of users, it should be approached through the application of the concept of universal design that considers the potential needs and psychological satisfaction of users. In arranging the indoor of the vehicles, the conditions for the facilities should be specified through the interdisciplinary approach from professional fields including ergonomics and psychology, the path of flow should be induced through the use of space and the analysis of passengers' behaviors, an integrated planning should be re-established, and continuous evaluations of basic guidelines, manuals, and requirements should be made.

Analysis of Infiltration Route using Optimal Path Finding Methods and Geospatial Information (지형공간정보 및 최적탐색기법을 이용한 최적침투경로 분석)

  • Bang, Soo Nam;Heo, Joon;Sohn, Hong Gyoo;Lee, Yong Woong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.1D
    • /
    • pp.195-202
    • /
    • 2006
  • The infiltration route analysis is a military application using geospatial information technology. The result of the analysis would present vulnerable routes for potential enemy infiltration. In order to find the susceptible routes, optimal path search algorithms (Dijkstra's and $A^*$) were used to minimize the cost function, summation of detection probability. The cost function was produced by capability of TOD (Thermal Observation Device), results of viewshed analysis using DEM (Digital Elevation Model) and two related geospatial information coverages (obstacle and vegetation) extracted from VITD (Vector product Interim Terrain Data). With respect to 50m by 50m cells, the individual cost was computed and recorded, and then the optimal infiltration routes was found while minimizing summation of the costs on the routes. The proposed algorithm was experimented in Daejeon region in South Korea. The test results show that Dijkstra's and $A^*$ algorithms do not present significant differences, but A* algorithm shows a better efficiency. This application can be used for both infiltration and surveillance. Using simulation of moving TOD, the most vulnerable routes can be detected for infiltration purpose. On the other hands, it can be inversely used for selection of the best locations of TOD. This is an example of powerful geospatial solution for military application.