• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.163-170
• /
• 2013

In general, images of outdoor scenes often contain degradation due to dust, water drop, haze, fog, smoke and so on, as a result they cause the contrast reduction and color fading. Haze removal is not easier problem due to the inherent ambiguity between the haze and the underlying scene. So, we propose a novel method to solve single scene dehazing problem using the region segmentation based on graph algorithm that has used a gradient value as a cost function. We segment the scene into different regions according to depth-related information and then estimate the global atmospheric light. The medium transmission can be directly estimated by the threshold function of graph-based segmentation algorithm. After estimating the medium transmission, we can restore the haze-free scene. We evaluated the degree of the visibility restoration between the proposed method and the existing methods by calculating the gradient of the edge between the restored scene and the original scene. Results on a variety of outdoor haze scene demonstrated the powerful haze removal and enhanced image quality of the proposed method.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.867-873
• /
• 2011

A navigation mesh (NavMesh) is a suitable tool for the representation of a three-dimensional game world. A NavMesh consists of convex polygons covering free space, so the path can be found reliably without detecting collision with obstacles. The main disadvantage of a NavMesh is the huge state space. When the $A^*$ algorithm is applied to polygonal meshes for detailed terrain representation, the pathfinding can be inefficient due to the many states to be searched. In this paper, we propose a method to reduce the number of states searched by using visibility tests to achieve fast searching even on a detailed terrain with a large number of polygons. Our algorithm finds the visible vertices of the obstacles from the critical states and uses the heuristic function of $A^*$, defined as the distance to the goal through such visible vertices. The results show that the number of searched states can be substantially reduced compared to the $A^*$ search with a straight-line distance heuristic.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.9 no.6
• /
• pp.788-794
• /
• 1985

A study on the number density in a dual beam LDV is carried out with moving particles of various irregular arrangements. Ratious of the particle diameter to the particle to the fringe Spacing are D/.delta. = 0.3, 0.5, 1.0 and 1.5. In the case of the small number of moving particles(N<10), the visibility is influenced much by the difference of the phase of particles for one side fringe and the change in visibility is shown remarkable. In the case of the larger number of particles, the decreasing rate for visibility on the graph is smooth because the effect of the phase difference of particles is decreased by more unitorm distribution of particles over fringes. And the formula of the number density on the basis of probability is fairly compared with experimental values.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.21-31
• /
• 2005

In state-of-the-art games, characters can move in a goal-directed manner so that they can move to the goal position without colliding obstacles. Many path-finding methods have been proposed and implemented for these characters and most of them use the A* search algorithm. When .the map is represented with a regular grid of squares or a navigation mesh, it often takes a long time for the A* to search the state space because the number of cells used In the grid or the mesh increases for higher resolution. Moreover the A* search on the grid often causes a zigzag effect, which is not optimal and realistic. In this paper we propose to use visibility graphs to improve the search time by reducing the search space and to find the optimal path. We also propose a method of taking into account the size of moving characters in the phase of planning to prevent them from colliding with obstacles as they move. Simulation results show that the proposed method performs better than the grid-based A* algorithm in terms of the search time and space and that the resulting paths are more realistic.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6360-6367
• /
• 2015

The location selection of the element that should guarantee easy visual perception, like the landmark, is the a topic that appears much in the design process. Recently, a graph analysis technique using computers has been applied in order to evaluate the visibility of the visual element, but the analytic frame is flat and the setting of the visual pont and the matrix are fixed so there were great limitations in obtaining the results of the practical analysis. Thus, this study presented Nondirectional Multi-Dimensional Calculation (MDVC-N), an analytic methodology available for the analysis of the dynamic visual point in the 3D environment. It thus attempted to establish the analytic application using the 3D computer graphics technology and designed a script structure to set the visual point and the matrix. In addition to that, this study tried to verify the analytic methodology by applying the complex land as an example model, where buildings in various heights of terrains with a high-differences are located, verifying the same analytic methodology. It thus tried to identify the visual characteristics of each alternative location. The following results were gained from the study. 1) The visibility can be measured quantitatively trough the application of the 6-alternatives. 2) Using the 3dimensional graph, intuitive analysis was possible. 3) It attempted to improve the analytic applicability by calculating the results corrected as a variable behavior from the local integration variable of the space syntax.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.2000-2013
• /
• 2016

The purpose of this study is to validate the validity of the methodology for analyzing the space with complex characteristics and to evaluate the existing spatial structure analysis theory. Seven example models are designed and analyzed data of spatial syntax analysis and visibility graph analysis. And analyzed the agent-based model using two analytical methods: the adjacent space and the whole spatial connection. The results of this study are as follows. Based on the analysis of the agent - based model for perfectly freewalking, the validity of the method is verified in terms of predictive ability and effectiveness. Agent-based models can be simulated considering various variables, so realistic predictions will be possible and a new biography of complex systems can be met.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.996-1003
• /
• 1990

We present algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, we represent the global topological structure of collision-free space. Using the C-space obstacle boundaries and this connectivity graph we generate exact (non-heuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles. The gross motion planning algorithm is further extended (though using approximations) to the case of objects moving with both translational and rotational degrees of freedom by taking slices of the overall orientations into finite segments.

• Korean Institute of Interior Design Journal
• /
• v.20 no.3
• /
• pp.225-232
• /
• 2011

This study analyzed characteristics of space configuration and exhibition contents in the Neo-classism style museum while carrying out space syntax and visibility graph analysis. Therefore, this research has the purpose to survey the status of existing museum analyze their visual perception space structural characteristics and ultimately utilize their characteristics as basic data in planning out and designing space. As for the research scope, the research selected as research subject 4 Neo-classism style museum in Europe and US that composite set of room to room type and having major space. Research method is that the research analyzed the exhibition space of 4 art museums by using depth-map program which can analyze space with visual graph analysis function and analyzed the visibility among unit areas by each art museum integration and exhibition contents composition. In such analysis method, the research was able to Quantitatively analyze the visual characteristics of exhibition space that induce and adjusts the motion of audience. Visual perception quantitive analysis as in this research will enhance exhibition design by considering the correlation between audience and exhibited items when planning out art museum space to be established later on. Therefore, wien museum integration degree are high because of same openings direction and major space, Also another museums major space integrations are high level degree, and Exhibition area is set of high integration area. So, visitors can perceive exhibition contents easily.