• Title/Summary/Keyword: Planar graph

Search Result 62, Processing Time 0.021 seconds

Efficient RMESH Algorithms for Computing the Intersection and the Union of Two Visibility Polygons (두 가시성 다각형의 교집합과 합집합을 구하는 효율적인 RMESH 알고리즘)

  • Kim, Soo-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.401-407
    • /
    • 2016
  • We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).

A Study on the Deduction of 3-Dimmensional Visual Structure and measurement of Quantitative Openness in Accordance with Spatial Probe Routes (공간탐색경로에 따른 3차원 시각구조 도출과 정량적 개방도 측정에 관한 연구)

  • Kim, Suk-Tae
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.112-120
    • /
    • 2010
  • Human can recognize the environment by detecting spatial perception, and most of environmental perception depends on visual perception. In view that the acquisition of spatial information is accomplished through visual recognition, analysis of visual structure contained in the space is thought to be very important sector in studying the characteristic of the space. The history of studies on visual structure of space, however, wasn't too long, and furthermore most of the theories up to now focused on static and planar principles. Under this circumstance, this study is intended to suggest new theory by combining Isovist theory and VGA theory that have been actively discussed as the theory on visual perception-based spatial structure and supplementing them between each other to expand into 3-dimensional model. The suggested theory is a complex principle in dimensional and dynamic form in consideration of visual direction, which forms 3-dimentional virtual model that enables visualization of the property of spatial structure as the routine discriminating whether visual connection is made between viewing point and target point, and the target point is included in the visual field quadrangular pyramid or not. Such model was built up by an analysis application where four probe paths were applied to simulate the visual structure that occurs in virtual space, and then the characteristics were analyzed through quantification. In result, in spite of the path with equal space and equal length, significant difference in the acquired quantity of spatial information could be found depending on the probe sequence. On the contrary, it was found that probe direction may not affect the acquired quantity of information and visual property of the space.