• 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.

• Korean Journal of Optics and Photonics
• /
• v.9 no.4
• /
• pp.245-250
• /
• 1998

A new computational algorithm is presented for the peak point detection of white light interferograms. Assuming the visibility function of white light interferograms as a quadratic polynomial, the peak point is searched so as to minimize the error sum between the measured intensity data and the analytical intensity. As compared with other existing algorithms, this new algorithm requires less computation since the peak point is simply determined with a single step matrix multiplication. In addition, a good robustness is obtained against external random disturbances on measured intensities since the algorithm is based upon least squares principles.

• Korean Journal of Optics and Photonics
• /
• v.11 no.5
• /
• pp.317-322
• /
• 2000

We present a compensation method of the phase change upon reflection in the scannll1g whIte light interferometry. which pracl1cally allows precIse 3-D profIle mappmg for compo~Ite target surfaces comprising of multipledissinular matenals. The compensation method estimates the vanatlon 01 pbase change with the spectral distribution of the light source through first-order approximation, and then diIectly compensates the measurement errors by perIormmg two-wavelength white light intetferomctric measurements. Experimental results prove that the proposed self-compensatIOn mcthod is capable of reducing the measmement error in step height gauging within $\pm2nm$..

• Korean Journal of Optics and Photonics
• /
• v.12 no.5
• /
• pp.362-370
• /
• 2001

We prove that 3-D profile mapping using white light interferometry has systematic errors caused by aberrations of the optimal system. The tilt of an object invokes an offset between the object and the reference ray, which eventually makes the aberration cancel incompletely. The fringe peak of a white light interferogram is mainly affected by the aberration effect while the envelope peak remains stable. By the difference between the two peaks, it is easily confirmed how much the error existed in the fringe peak. Experimental results prove that the error caused by aberration is varied by object tilt, microscope NA, optics alignment within the range of $\pm$50nm.

• Korean Journal of Optics and Photonics
• /
• v.15 no.4
• /
• pp.331-336
• /
• 2004

The phase change due to the reflection from target surfaces in a white-light interferometer induces measurement errors when target surfaces are composed of dissimilar materials. We prove that this phase change on reflection as the polarization of the white-light changes causes a shift of both envelope peak position and fringe peak position of several tens of nanometers as the polarization of the white-light changes. In addition, we propose a new equation for white-light interference fringes depending on the polarization of the source.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.739-741
• /
• 2005

최근 게임에서 자주 등장하기 시작한 랜덤 지형 맵 생성기법으로 인해 단순한 경로 찾기가 아닌 지형분석을 통한 복잡한 경로 찾기 문제가 많은 관심을 받고 있다. 이에 로보틱스 분야에서 경로 찾기에 이용되는 가시성그래프(Visibility Graph, Vgraph)가 지형분석과 경로 찾기를 동시에 해결할 수 있는 방법으로 제안되고 있다. Vgraph를 이용하면 지형의 로드맵을 효과적으로 생성할 수 있을 뿐 아니라 A* 알고리즘과 결합하여 최적의 경로를 찾는 것을 보장하는 장점이 있다. 그러나 Vgraph에 의해 구해진 경로는 장애물의 정점에서 정점으로 이동하기 때문에 항상 장애물의 모서리를 향해 움직이며 벽에 붙어가는 듯이 보여 부자연스러운 것이 단점이다. 본 논문에서는 설계자가 요구하는 여유공간 c만큼 장애물을 확장하여 확장된 장애물에 대해 가시성그래프를 생성함으로써, Vgraph의 장점은 유지하며 단점을 보완할 수 있는 방법에 대해 제안한다.

• Journal of Korea Game Society
• /
• v.8 no.3
• /
• pp.69-76
• /
• 2008

This paper presents a novel rendering algorithm based on sperical coordinate representation of the object. The vertices of the object are transformed into the sperical coordinate system, and we construct additional maps: the centroid and index of the triangle, the memory access table. While OpenGL rendering pipeline touches all vertices of an object, the proposed method takes account of the only visible vertices by examining the visible triangles of the object. Simulation results demonstrated that the proposed method achieve an efficient rendering performace.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

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 and union 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. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.204-207
• /
• 2005

We discuss two possibilities of using femtosecond pulse lasers as a new interferometric light source fer enhanced precision surface profile metrology. First, a train of ultra-fast laser pulses yields repeated low temporal coherence, which allows performing unequal-path scanning interferometry that is not feasible with white light. Second, high spatial coherence of femtosecond pulse lasers enables to test large size optics in non-symmetric configurations with relatively small size reference surfaces. These two advantages are verified experimentally using Fizeau and Twyman-Green type scanning interferometers.