• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.149-156
• /
• 2006

This paper presents a novel approach for constructing a piecewise triangular cubic polynomial surface with $C^1$ continuity around a common corner vertex. A $C^1$ continuity condition between two cubic triangular patches is first derived using mixed directional derivatives. An approach for constructing a surface with $C^1$ continuity around a corner is then developed. Our approach is easy and fast with the virtue of cubic reproduction, local shape controllability, $C^2$ continuous at the corner vertex. Some experimental results are presented to show the applicability and flexibility of the approach.

• Journal of Trauma and Injury
• /
• v.30 no.3
• /
• pp.98-102
• /
• 2017

Vertex epidural hematoma (VEH) is an uncommon presentation of all epidural hematomas and presents with a wide range of symptom and signs. Diagnosis as well as treatment of VEH is also difficult because of its location adjacent to superior sagittal sinus (SSS). A 43-year-old male visited our hospital after fall down and was diagnosed with VEH. While evaluating its location and patency of SSS, he was deteriorated and urgently underwent evacuation of VEH. Bilateral craniotomies on each side, leaving a central bony island to avoid bleeding of midline structure and provide an anchor for dural tack-ups. After the operation, VEH was totally removed and the patient has restored.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.312-325
• /
• 1990

This paper addresses the process of information dissemination in a network whereby a message, originated at a node, is transmitted to all other nodes of the network. We restrict our attention to a speccial type of dissemination process,called 'local broadcasting', where a vertex can either transmit or receive a message and an informed vertex can transmit it to only one of its neighbors at a time. Based on the recently published results for a tree by Koh and Tcha, this paper proposes an efficient heuristic which determines the call sequence at each vertex node under both minimax and minisum criteria. Computational experiments with this heuristic are conducted on a variety of networks of medium size.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.245-250
• /
• 2020

Let γt(G) and τ(G) denote the total domination number and vertex cover number of graph G, respectively. In this paper, we study the total domination number of the central tree C(T) for a tree T. First, a relationship between the total domination number of C(T) and the vertex cover number of tree T is discussed. We characterize the central trees with equal total domination number and independence number. Applying the first result, we improve the upper bound on the total domination number of C(T) and solve one open problem posed by Kazemnejad et al..

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.553-556
• /
• 1988

Recognition of IC chip pattern requires extraction of features, which have the information of vertex position and orientation. Edges are extracted and straightening algorithm is applied to the edges, so that lines are obtained. With these extracted data, the coordinate and orientation of all vertices are extracted and vertex-form matching is applied to the locally overlapped area of neighborhood frames to have global coordinate of IC chip.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.25-30
• /
• 2003

The numerical simulations with unstructured mesh by cell-centered and vertex-centered approaches were performed for the quadrilateral and triangular meshes. For the 2-D incompressible supersonic vortex flow, the simulation results and the analytic solution were compared and the accuracy was assessed. The calculation efficiency was measured by the parameter defined by the consumed CPU time multiplied by absolute error, As a results, equilateral triangular mesh yielded the best accuracy and efficiency among the tested meshes.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1059-1075
• /
• 2019

Let G be a graph with no isolated vertex. A total dominating set, abbreviated TDS of G is a subset S of vertices of G such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a TDS of G. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph C(G) in terms of some invariants of the graph G. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.