• 한국정보통신학회논문지
• /
• 제23권9호
• /
• pp.1146-1151
• /
• 2019

히스토그램 H는 가장 왼쪽 수직 에지와 가장 오른쪽 수직 에지를 연결하는 기저라고 불리는 하나의 수평 에지를 가진 x-단조 직교 다각형이다. 여기서 직교 다각형은 수평과 수직 에지들만을 가진 다각형이고, x-단조 다각형 P는 x-축에 수직인 모든 직선이 P와 많아야 두 번 교차하는 성질을 만족하는 다각형이다. 히스토그램 H의 테두리 선을 따라 반시계방향으로 움직이면, 꼭짓점에서 왼쪽 회전과 오른쪽 회전의 수열을 얻는다. 역으로, 꼭짓점에서의 회전들로 이루어진 수열이 히스토그램에 의해서 구현될 수 있다. 이 논문에서 우리는 주어진 회전 수열을 구현하는 히스토그램을 찾는 문제를 다룬다. 특별히 면적을 최소화하는 히스토그램과 구속 상자를 최소화하는 히스토그램을 찾을 것이다. 두 문제 모두 선형 시간 알고리즘들에 의해 풀리는 것을 보일 것이다.

• Journal of information and communication convergence engineering
• /
• 제8권1호
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1547-1550
• /
• 1987

This paper describes a new design rule checking system, PC-DRC, for CIF mask layout, which was written in C language on IBM PC/AT under DOS 3.0 environment. H/W devices and S/W utilities for PC-DRC is identical to that for PC-LADY[6], which makes PC-DRC an ideal post-processing routine for CIF file generated by PC-LADY. Various spurious errors were eliminated by ORing the input ClF data for each layer and the design rule errors were checked by edge based method on rectilinear polygon form. The detected errors are stored in CIF and displayed on CRT simultaneously.