• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.63-69
• /
• 2012

Given art gallery P with n vertices, the maximum (sufficient) number of mobile guards is${\lfloor}n/4{\rfloor}$ for simple polygon and${\lfloor}(3n+4)/16{\rfloor}$ for simple orthogonal polygon. However, there is no polynomial time algorithm for minimum number of mobile guards. This paper suggests polynomial time algorithm for the minimum number of mobile guards. Firstly, we obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, we select vertex u with ${\Delta}(G)$ and v with ${\Delta}(G)$ in $N_G(u)$ and delete visible edges from u,v and incident edges. Thirdly, we select $w_i$ in partial graphs and select edges that is the position of mobile guards. This algorithm applies various art galley problems with simple polygons and orthogonal polygons art gallery. As a results, the running time of proposed algorithm is linear time complexity and can be obtain the minimum number of mobile guards.

• 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 Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.41-47
• /
• 2016

This paper considers simple polygon search problem. How many searchers find a mobile intruder that is arbitrarily faster than the searcher within polygon art gallery? This paper uses the visibility graph that is connected with edges for mutually visible vertices. Given visibility graph, we select vertex u that is conjunction ${\Delta}(G)$ in $N_G(v)$ for $d_G(v){\leq}4$. We decide 1-searchable if $1{\leq}{\mid}u{\mid}{\leq}2$ and 2-searchable if ${\mid}u{\mid}{\geq}3$. We also present searcher's shortest path. This algorithm is verified by varies 1 or 2-searchable polygons.

• Journal of Science of Art and Design
• /
• v.8
• /
• pp.5-43
• /
• 2005

This study aimed to suggest a resolution through a research on actual condition of appreciation class among art classes in elementary school. For this object, this study is about the need and problem of appreciation through concert of art appreciation and educational meaning. And this study is research, based on 200 current teachers to teach the art education of appreciation in Seoul. In the case of student research, this study show the current appreciation education focusing on 200 students in Seoul. The teachers has been seeing the importance of the appreciation education, but that education has been performing in the poor environment without aids and appreciation materials. And they thought that the most effective way to teach the appreciation of art is the on-site education such as the invitation of art-gallery or museum. The Change of realization about art, together with improvement of realistic situation, is important. But more important problem is the role and the realization of teacher who teach art directly. If the teacher's viewpoint to teach directly education of appreciation is examined, there are following problems First, it lacks realization about the importance of appreciation education. Teachers who teach a student have been taken functional art education mainly and this trend has been spread in the whole of society, therefore, the importance about the teaching of appreciation is negligent and is handled indifferently. Also, Teachers do not offer opportunity to obtain professional information of art appreciation map to overemphasize the study of practical teaching research. Second, elementary schools teacher is, for the most part, occasion that homeroom teacher teaches all object classes, and complete charge teacher is selected only some. Therefore, teacher in charge who play most a lot of subjects is difficult to recognize the importance of art teaching appreciation subject or class. There must have been a research about the educational preventive measures as suitable support, reorganization of at time and experts in superior office educational institution. Trough this study, I could know that front-line teacher should be specialized and more complete charge teacher should be needed urgently. Finally, the teachers must break the custom of the art appreciation and develop various art appreciation method. And the teachers have to lead the students to be interested art appreciation. That's what cultivate the students' aesthetic feeling and genius.

• Archives of design research
• /
• v.18 no.1 s.59
• /
• pp.195-204
• /
• 2005

Due to the of evolution of digital technology, trends are moving toward personalization and customization in design (art), media, science. Existing mass media has been broadcasting to the general public due to technical and economic limitation and art works also communicate one-sidedly with spectators in the gallery or stage. But nowaday, it is possible for spectators to participate directly. We can make different products depending on the tastes of individuals who demand media or art. The essence of technology which makes it possible is 'interactive technology'. A goal of this research is to find out the true nature of the interactive design in multimedia contents and find the course of interactive communication design research. In this paper, we pass through two stages to solve this kind of problem. At first, we studied the concept of multimedia contents from the aspect of information revolution. Next, we decided our research topic to be 'visual reacting with audio' and made audio-visual art work as graphic designers. Through this research we can find the possibility to promote 'communication' in a broad sense, with appropriate interactive design.

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.295-300
• /
• 2008

In this paper, we consider a characterization of a Guard Sufficiency Set(GSS) in the hierarchy of simple polygons. we propose the diagonals of a arbitrary triangulation of a polygon as a GSS when guards see the diagonals with completely visibility and both sides of the diagonal. we show that this can be a GSS in convex polygons, unimodal polygons, spiral polygons but this can not be a GSS in star-shaped polygons, monotone polygons, completely external visible polygons.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.102-111
• /
• 2004

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection, union, or difference can be executed on them. The intersection (resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. The difference of two visibility polygons is the set of points which are visible from only a visibility source. Previously, the best known algorithm for the set operations of two polygons with total n vertices takes O(nlogn ＋ k) time, where k is the output size. In this paper, we present O(n) time algorithms for computing the intersection, the union, and the difference of given two visibility polygons, which are optimal.