• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.135-143
• /
• 1990

A new over-the-cell routing system is proposed in this paper. The proposed system efficiently reduces not only the channel density but also the routing density in cell region. Generally, the over-the-cell system consists of three phases. Namely, over-the-cell routing, terminal selection and channel routing. In this paper, to select the nets to be routed over the cells, weights are assigned on the intersection graph considering both the channel density and the intersection relations among other nets. When selected nets are blocked by feedthroughs or metal layers for internal logic, they are routed by maze algorithm. Also, in order to reduce channel density, the terminals to be routed in a channel are selected using the minimum weight spanning tree. Channel routing is carried out with a channel router of HAN-LACAD_G. The effectiveness of the over-the-cell routing system is shown by the experiments with benchmark data and its application to the gate array layout system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.723-729
• /
• 2001

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. The users connect to the Solid Modeler Server through m and they create 3D shape and manipulate them variously. Then the users will share 3D objects and two problems can arise. The users must be able to pick the objects effectively which they want to manipulate. When one of the users manipulates a particular object, others should not disturb with the same object. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy. To have effective concurrency, we used shared lock and exclusive lock as the action in work space.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.595-598
• /
• 2020

IoU (Intersection over Union) is the most commonly used index in target detection. The core requirement of target detection is what is in the image and where. Based on these two problems, classification training and positional regression training are needed. However, in the process of position regression, the most commonly used method is to obtain the IoU of the predicted bounding box and ground-truth bounding box. Calculating bounding box regression losses should take into account three important geometric measures, namely the overlap area, the distance, and the aspect ratio. Although GIoU (Generalized Intersection over Union) improves the calculation function of image overlap degree, it still can't represent the distance and aspect ratio of the graph well. As a result of technological progress, Bounding-Box is no longer represented by coordinates x,y,w and h of four positions. Therefore, the IoU can be further optimized with the center point and aspect ratio of Bounding-Box.

• East Asian mathematical journal
• /
• v.36 no.5
• /
• pp.561-570
• /
• 2020

We compute the extended four operations of the 2-dimensional quadratic fuzzy numbers. Then we calculate the intersection between a plane perpendicular to the x-axis, which passes through each vertex, and the resulting 2-dimensional quadratic fuzzy number. We confirm that the equations of the two intersections acquired in this way and the graphs are actually identical, respectively.

• Honam Mathematical Journal
• /
• v.36 no.2
• /
• pp.435-454
• /
• 2014

We show that for any graph G, the proper part of the intersection poset of the corresponding graphical arrangement $\mathcal{A}_G$ has the homotopy type of a wedge of spheres. Furthermore, we also indicate the number of spheres in the wedge, based on the number of spanning forests of G and other graphs that are obtained from G.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.631-633
• /
• 2001

협동설계시스템에서의 공유 오브젝트는 3D 도형이 되며, 사용자가 임의의 오브젝트를 picking하는 문제와 그 오브젝트에 어떤 조작을 취할 때 동시성제어(concurrency)하는 문제가 생긴다. 본 논문에서는 오브젝트의 picking이 마우스 포인터에서의 ray와 오브젝트간에 intersection을 계산하는 방법 외에 scene graph의 노드에 picking 속성을 주는 방법, bounds를 설정하는 방법, picking test의 범위를 한정하는 방법을 사용하여 computation의 부담을 줄이고 효과적인 동시성제어가 이루어지도록 action에 따라 공유(shared)lock과 전용(exclusive)lock을 사용한다.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.155-167
• /
• 2007

A graph G is called to be a 2-degree integral subgraph of a q-tree if it is obtained by deleting an edge e from an integral subgraph that is contained in exactly q - 1 triangles. An added-vertex q-tree G with n vertices is obtained by taking two vertices u, v (u, v are not adjacent) in a q-trees T with n - 1 vertices such that their intersection of neighborhoods of u, v forms a complete graph $K_{q}$, and adding a new vertex x, new edges xu, xv, $xv_{1},\;xv_{2},\;{\cdots},\;xv_{q-4}$, where $\{v_{1},\;v_{2},\;{\cdots},\;v_{q-4}\}\;{\subseteq}\;K_{q}$. In this paper we prove that a graph G with minimum degree not equal to q - 3 and chromatic polynomial $$P(G;{\lambda})\;=\;{\lambda}({\lambda}-1)\;{\cdots}\;({\lambda}-q+2)({\lambda}-q+1)^{3}({\lambda}-q)^{n-q-2}$$ with $n\;{\geq}\;q+2$ has and only has 2-degree integral subgraph of q-tree with n vertices and added-vertex q-tree with n vertices.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.2
• /
• pp.79-86
• /
• 2001

This study shows an attempt to generate an assembly sequence and its model for a ship block assembly using the graph theory and graph algorithms. To generate the ship block assembly, we propose four levels of the ship block assembly model such as "geometry mode1", "relational model", "sequential mode1", and "hierarchical model". To obtain the relational model, we used surface and surface intersection algorithm. The sequential model that represents a possible assembly sequence is made by using several graph algorithms from the relational model. The hierarchical model will be constructed from the sequential model in order to represent the block assembly tree and so forth. The purpose of the hierarchical model is to define an assembly tree and to generate the Bill Of Material(BOM). Lastly, the validity of the method proposed in this study is examined with application to ship block assembly models of a single type and double type according to four models mentioned above.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.85-101
• /
• 2018

Let S be a polynomial ring over a field K, with a monomial order ${\prec}$, and let I be an unmixed graded ideal of S. In this paper we study two functions associated to I: The minimum distance function ${\delta}_I$ and the footprint function $fp_I$. It is shown that ${\delta}_I$ is positive and that $fp_I$ is positive if the initial ideal of I is unmixed. Then we show that if I is radical and its associated primes are generated by linear forms, then ${\delta}_I$ is strictly decreasing until it reaches the asymptotic value 1. If I is the edge ideal of a Cohen-Macaulay bipartite graph, we show that ${\delta}_I(d)=1$ for d greater than or equal to the regularity of S/I. For a graded ideal of dimension ${\geq}1$, whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.