• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

• 한국정보과학회논문지:시스템및이론
• /
• 제27권2호
• /
• pp.123-134
• /
• 2000

등치선(wire-frame contour)으로 표현된 물체의 볼륨정보에서부터 3차원 표면을 재구성하는 방법을 제안한다. 등치선 삼각화법(contour triangulation)이라고도 하는 이 방법에서 가장 문제가 되는 것이 인접 단층사이에서 표면이 분기하는 경우에 발생하는데, 이것은 하나의 등치선이 인접한 층의 두 개이상의 등치선과 연결되는 형태로 나타나며, 표면 생성시의 많은 모호성을 발생시킨다. 본 논문에서는 이러한 분기문제를 가장 일반적으로 발생하는 이중분기문제와 그 이상의 다중분기문제로 구분하고, 먼저 이중 분기 알고리즘을 제안하였으며, 다중분기문제를 다수의 이중분기문제로 단순화하는 다중분기 알고리즘을 제안하였다. 제안된 이중분기 알고리즘은 모 등치선을 분할하는 방법을 이용하였는데, 먼저 해협다각형을 정의하고 이를 삼각분할하여 분할선을 구하는 것에 바탕을 두고 있다. 이 방법은 이중분기가 매우 복잡하게 나타나는 경우에도 잘 적용이 되며, 분할선의 레벨을 조절함으로써 매우 사실적인 표면을 만들어 낼 수 있다는 장점이 있다. 또한 다중분기문제를 단층 간격의 문제로 규정하고, 인접한 두 층 사이에 가상의 등치선을 추가하여 가지 등치선을 연속적으로 병합하는 방법으로 해결하였다. 제안된 방법은 등치선 삼각화의 가장 큰 문제인 분기문제를 해결하기 위한 매우 구조적인 접근방법으로, 다양한 실제 등치선 데이타에 적용한 결과 좋은 성능을 나타냈다.

• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.9-18
• /
• 1996

Many algorithms have been developed for optimizing the asymmectric traveling salesman problem known as a representative NP-Complete problem. The most efficient ones of them are branch and bound algorithms based on the subtour elimination approach. To increase efficiency of the branch and bound algorithm. number of decision nodes should be decreased. For this the minimum bound that is more close at the optimal solution should be found or an effective bounding strategy should be used. If the optimal solution has been known, we may apply it usefully to branching. Because a good feasible solution should be found as soon as possible and have similar features of the optimal solution. By the way, the upper bound solution in branch and bound algorithm is most close at the optimal solution. Therefore, the upper bound solution can be used instead of the optimal solution and information of which can be applied to new branching criteria. As mentioned above, this paper will propose an effective branching rule using the information of the upper bound solution in the branch and bound algorithm. And superiority of the new branching rule will be shown by comparing with Bellmore-Malone's one and carpaneto-Toth's one that were already proposed.

• 정보처리학회논문지B
• /
• 제14B권6호
• /
• pp.413-422
• /
• 2007

등고선으로 표현된 물체의 볼륨정보에서부터 3차원 표면을 재구성하는 새로운 알고리즘을 제안한다. 등고선 삼각분할법이라고도 불리는 이 방법의 가장 어려운 문제가 인접 단층사이에서 표면이 다중으로 분기하는 경우에 발생하는데, 이것은 하나의 등고선이 인접한 층의 두 개 이상의 등고선과 연결되는 형태로 나타나며, 표면 생성시 많은 모호성을 발생시킨다. 본 논문에서는 이러한 다중분기문제를 여러 개의 가상벨트와 가상계곡으로 나누어 이들에 대한 표면생성문제로 단순화 시키는 방법을 제안한다. 가상벨트의 표면생성에는 띠분할 알고리즘을 채택하였으며, 가상계곡은 반복적인 볼록정점 제거와 중앙정점 추가로 보다 자연스러운 표면을 생성한다. 기존의 대부분의 알고리즘특이 다중분기문제를 한 쌍의 등고선간의 표면생성문제로 변환하는데 초점을 맞추는데 비해 제안된 방법은 더 작은 형태인 가상벨트와 가상계곡으로 단순화한다. 또한 제안된 방법은 표면정의에 복잡한 기준을 사용하지 않으며, 표면삼각분할을 위한 매우 명확하고 일관된 알고리즘을 제공한다. 실험을 통해 제안된 방법이 많은 분기가 발생하는 복잡한 데이터에서도 잘 동작하는 것을 알 수 있었다.

• 대한산업공학회지
• /
• 제24권1호
• /
• pp.77-93
• /
• 1998

It is discussed how to locate idle vehicles of AGVS on unidirectional guide paths. The problem is modeled as a median location problem on a cyclic network. The characteristics of the optimal location are analyzed and some useful properties are suggested to reduce the solution space. Based on the properties found, several special types of networks - a pure single-loop type, the loop type with a single branching intersection and the loop type with local branching node - are also analyzed as well as the general cyclic network. In each case of the networks, a solution procedure is suggested. Some numerical examples are provided to illustrate the algorithms developed.

• 경영과학
• /
• 제26권3호
• /
• pp.1-9
• /
• 2009

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2005년도 추계학술대회논문집
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.1-19
• /
• 1994

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

• 한국컴퓨터산업학회논문지
• /
• 제5권3호
• /
• pp.377-382
• /
• 2004

무제한 3차원 절단문제는 커다란 직육면체 자재에서 작은 직육면체 제품을 잘라낼 때, 잘라낸 제품의 가치가 최대가 되도록 하는 절단패턴을 찾는 문제이다. 이 때, 잘려지는 각각의 제품은 고유의 크기와 가치를 갖는다. 두 개의 절단패턴을 결합해서 새로운 절단패턴을 만들어 내는 상향식 접근법은 무제한 3차원 절단문제를 푸는 해법으로 사용할 수 있다. 본 논문에서는, Wang이 제안한, 2차원 문제에서 사용되는 두 가지 결합 외에 새로운 결합을 정의하고, 지 등이 무제한 2차원 절단 문제를 풀기 위해 제안한 분지전략을 3차원 문제에서 사용할 수 있도록 새롭게 재구성한다.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.