• Title/Summary/Keyword: mesh reordering

Search Result 6, Processing Time 0.019 seconds

The Effect of Mesh Reordering on Laplacian Smoothing for Nonuniform Memory Access Architecture-based High Performance Computing Systems (NUMA구조를 가진 고성능 컴퓨팅 시스템에서의 메쉬 재배열의 라플라시안 스무딩에 대한 효과)

  • Kim, Jbium
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.3
    • /
    • pp.82-88
    • /
    • 2014
  • We study the effect of mesh reordering on Laplacian smoothing for parallel high performance computing systems. Specifically, we use the Reverse-Cuthill McKee algorithm to reorder meshes and use Laplacian Smoothing to improve the mesh quality on Nonuniform memory access architecture-based parallel high performance computing systems. First, we investigate the effect of using mesh reordering on Laplacian smoothing for a single core system and extend the idea to NUMA-based high performance computing systems.

Effectiveness of DUPACK-independent TCP in Coded Wireless Mesh Networks (중복 승인을 사용하지 않는 TCP의 코드화된 무선 메쉬 망에서의 효과)

  • Lim, Chan-Sook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.7-13
    • /
    • 2011
  • While the TCP throughput degradation problem in coded wireless mesh networks is well-known, few effective solutions have been proposed. Most schemes proposed attempts to mask packet reordering by ordering packets at a lower layer or to adjust a packet transmission rate to solve the scarcity problem of coding opportunities. Through the throughput comparison of traditional standard TCP variants, we show that losses and duplication of TCP acknowledgements in coded wireless mesh networks can impact throughput. In addition, we show that a TCP variant that does not rely on duplicate acknowledgements is more suitable for coded wireless mesh networks.

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

  • Jang, Seowoo;Kang, Seok-Gu;Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.411-419
    • /
    • 2017
  • The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

Performance Analysis of a Parallel Mesh Smoothing Algorithm using Graph Coloring and OpenMP (그래프 컬러링과 OpenMP를 이용한 병렬 메쉬 스무딩 알고리즘의 성능 분석)

  • Shin, Myeonggyu;Kim, Jibum
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.6
    • /
    • pp.80-87
    • /
    • 2016
  • We propose a parallel mesh smoothing algorithm using graph coloring and OpenMP library for shared memory many core computer architectures. The proposed algorithm partitions a mesh into independent sets and performs a parallel mesh smoothing using OpenMP library. We study the effect of using various graph coloring and color reordering algorithms on the efficiency of performing the proposed parallel mesh smoothing algorithm. We also investigate the influence of using various OpenMP loop scheduling methods on the parallel mesh smoothing efficiency.

Multi-resolutional Representation of B-rep Model Using Feature Conversion (특징형상 변환을 이용한 B-rep모델의 다중해상도 구현)

  • 최동혁;김태완;이건우
    • Korean Journal of Computational Design and Engineering
    • /
    • v.7 no.2
    • /
    • pp.121-130
    • /
    • 2002
  • The concept of Level Of Detail (LOD) was introduced and has been used to enhance display performance and to carry out certain engineering analysis effectively. We would like to use an adequate complexity level for each geometric model depending on specific engineering needs and purposes. Solid modeling systems are widely used in industry, and are applied to advanced applications such as virtual assembly. In addition, as the demand to share these engineering tasks through networks is emerging, the problem of building a solid model of an appropriate resolution to a given application becomes a matter of great necessity. However, current researches are mostly focused on triangular mesh models and various operators to reduce the number of triangles. So we are working on the multi-resolution of the solid model itself, rather than that of the triangular mesh model. In this paper, we propose multi-resolution representation of B-rep model by reordering and converting design features into an enclosing volume and subtractive features.

A Watermarking Algorithm of 3D Mesh Model Using Spherical Parameterization (구면 파라미터기법을 이용한 3차원 메쉬 모델의 워더마킹 알고리즘)

  • Cui, Ji-Zhe;Kim, Jong-Weon;Choi, Jong-Uk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.1
    • /
    • pp.149-159
    • /
    • 2008
  • In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.