• Journal of the Korea Computer Graphics Society
• /
• v.9 no.4
• /
• pp.25-30
• /
• 2003

본 논문에서는 서로 다른 개수의 정점을 가지는 두 다면체 사이의 점진적 다면체 모델 표현(Progressive Mesh Representation)을 계산하는 휴리스틱 방법을 제시한다. 정점의 개수가 각각 n, k개 인 두 다면체 모델 $M^n$, $M^k$ (n > k)에 대하여 $M^n$에서 서로 다른 k개의 정점을 선택한다. 선택된 k개의 정점을 기준으로 $M^n$의 모든 정점에 대한 클러스터링을 수행하여 k개의 정점군(Vertex Set)을 생성한다. $M^n$을 간략화하여 k개의 정점만을 가지는 모델 $M^{k'}$의 위상정보(Topology)를 $M^k$와 동일하게 유지하기 위하여 $M^n$ 정점군들의 위상정보를 수정한다. 수정 생성된 정점군 내에서 선분병합(Edge Collapse)을 수행하면, 위상정보를 유지하면서 $M^n$에서 $M^k$로 변화하는 점진적 다면체 모델 표현을 얻을 수 있다. $M^{k'}$과 $M^k$의 정점간의 기하학적 위치차이를 선형보간하여 선분병합이 일어날때 마다 반영하면 $M^n$에서 $M^k$로 기하정보를 부드럽게 유지하면서 변화하는 점진적 다면체 모델 표현을 얻을 수 있다. 본 논문의 연구결과는 기존의 DLoD(Discrete Level of Detail)를 지원하는 게임을 CLoD(Continuous Level of Detail)를 지원하는 게임으로 확장하는 등의 다양한 컴퓨터 그래픽스 응용문제에 사용할 수 있다.

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

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.1
• /
• pp.85-91
• /
• 2008

White light scanning interferometry has gotten a firm position in 3D surface profile measuring field. Recently, the LCD industry gave a chance for this technology to enter into real industry fields. It is known that white-light phase-shifting algorithm give a best resolution compare to other algorithms, but there are some problems to be resolved. One of them is 300nm jump in height profile, called bat-wing effect. The main reason of this problem is an ambiguity of phase-peak detection algorithm, and some solution has been proposed, but it didn't work perfectly. In this paper, I will show the cases when these effects are occurred, and these height discrepancies will be almost disappeared when broad-band illuminators are used.

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

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.49-52
• /
• 2000

최근에 3차원 데이터는 그 크기가 상당히 커지고 있으며, 이에 따라 3D 그래픽 파이프라인에 데이터를 전송할 때 메모리 버스 대역폭의 병목 현상에 대한 문제가 크게 대두되고 있다. 이를 해결하기 위한 방법으로 모델링된 3차원 데이터의 위상 정보를 압축하여 보내는 방법이 연구되고 있다. 본 논문에서는 3차원 데이터의 위상 정보를 효율적으로 압축하는 방법과 자료구조를 제안하였다. 기존의 위상 압축 방법들의 선형적인 탐색 방법에 비해 보다 효율적인 나선형 깊이 우선 탐색 방법을 사용하였다. 제안하는 방법은 이미 탐색한 정점들의 재사용도를 높임으로써 압축과정에서 생성되는 허프만 테이블의 크기를 줄였고 전체적으로 압축되는 데이터의 크기도 보다 줄였다. 실험한 결과, 비트수/정점이 평균 1.7 정도이었고, 비트수/폴리곤이 평균 1.3 정도고 이전 방법들보다 1.5배에서 2.5배정도 나은 결과를 보였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

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

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.4
• /
• pp.1-8
• /
• 2001

3D mesh metamorphosis (morphing) deals with two input polyhedral objects and generates an animation in which the source mesh gradually changes to the target through in-between meshes. The basic and common idea of previous mesh morphing techniques can be summarized as the construction and interpolation of a metamesh. However, an approach based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh and overcomes the limitations of previous work. The approach simultaneously interpolates the topology and geometry of input meshes. With the approach, an in-between mesh contains only the vertices from the source and target meshes. Since no additional vertices are introduced, the in-between meshes are much simpler than those generated by previous techniques.