• 한국CDE학회논문집
• /
• 제9권2호
• /
• pp.122-132
• /
• 2004

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size. Thus, an arbitrary solid model SM designed by a set of design features is stored as a much coarser solid model SM/sup 0/ together with a sequence of n detail records that indicate how to incrementally refine SM/sup 0/ exactly back into the original solid model SM = SM/sup 0/.

• 한국전산구조공학회논문집
• /
• 제23권5호
• /
• pp.535-541
• /
• 2010

본 연구에서는 정상상태의 비선형 열탄성 문제에 대하여 탄성 계수 및 열전도 계수에 대해서 보조변수법을 이용한 연속체 기반의 설계민감도 방정식을 유도하였고, 온도와 변위장이 연성된 보조방정식을 정의하여 효율적으로 설계민감도 해석을 수행하여 위상 최적설계에 적용하였다. 수치 예제를 통하여 열탄성 문제에서 위상 최적설계가 갖는 요소망 의존성을 살펴보았다. 또한 열 하중이 지배적인 경우와 기계적 하중이 지배적인 경우를 비교하여 다중 물리 연성문제에서 위상 최적설계가 갖는 하중에 대한 의존성을 고찰하였다.

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.137-142
• /
• 2004

In this paper, we propose a new scheme for geometry coding of three-dimensional (3-D) mesh models using a fixed spectral basis. In order to code the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the 3-D mesh topology. After we partition a 3-D mesh model into several independent sub-meshes to reduce coding complexity, the mesh geometry information is projected onto the generated orthonormal bases which are the eigenvectors of the Laplacian matrix of the 3-D mesh. Finally, spectral coefficients are coded by a quantizer and a variable length coder. The proposed scheme can not only overcome difficulty of generating a fixed spectral basis, but also reduce coding complexity. Moreover, we can provide an efficient multi-resolution representation of 3-D meshes.

• Structural Engineering and Mechanics
• /
• 제75권6호
• /
• pp.685-699
• /
• 2020

Polygonal finite element provides a great flexibility in mesh generation of crack propagation problems where the topology of the domain changes significantly. However, the control of the discretization error in such problems is a main concern. In this paper, a polygonal-FEM is presented in modeling of crack propagation problems via an automatic adaptive mesh refinement procedure. The adaptive mesh refinement is accomplished based on the Zienkiewicz-Zhu error estimator in conjunction with a weighted SPR technique. Adaptive mesh refinement is employed in some steps for reduction of the discretization error and not for tracking the crack. In the steps that no adaptive mesh refinement is required, local modifications are applied on the mesh to prevent poor polygonal element shapes. Finally, several numerical examples are analyzed to demonstrate the efficiency, accuracy and robustness of the proposed computational algorithm in crack propagation problems.

• 한국컴퓨터그래픽스학회논문지
• /
• 제24권1호
• /
• pp.1-8
• /
• 2018

본 논문에서는 삼각형 집합(triangle soup)형식의 등가면(isosurface)을 추출하는 기존의 마칭큐브 기법을 개선하여, 연결된 메시(connected mesh)형식으로 추출하는 실시간 기법을 제안한다. 이를 통해 기존에는 불가능했던 다양한 렌더링 기법을 사용하여 동적으로 변하는 등가면을 렌더링할 수 있고, 등가면의 위상(topology)과 기하(geometry) 정보 등을 추출할 수 있다. 또한 지오메트리 셰이더 (geometry shader) 에서 사용하는 인접 삼각형 형태의 구조 (GL_TRIANGLES_ADJACENCY)를 생성하여 보다 다양한 셰이딩 기법을 지원한다. 본 기법은 기존 마칭큐브에 삼각형들을 연결하는 후처리 과정을 추가한 기법에 비해 300% 정도의 향상된 등가면 추출 속도를 보인다.

• 한국통신학회논문지
• /
• 제32권11B호
• /
• pp.663-672
• /
• 2007

본 논문에서는 WDM 기술을 사용하는 광전달망에서 멀티플-링 구조를 임의의 토폴로지에 적용하는 설계 알고리즘을 제안한다. 특히, ROADM 기반의 노드를 이용하여, 노드 비용 최소화를 목적함수로 갖는 정수선형계획법(ILP)을 제시하고, 선형문제의 복잡성 완화를 위한 휴리스틱 알고리즘을 제안하였다. 설계 알고리즘의 타당성과 성능 측정을 위해, NSFnet 토폴로지의 망 설계 결과를 제시하고, 정적/동적 트래픽 상황 각각에 대해 비용적인 측면과 요청 트래픽 수용 측면에서 그물망 구조와 비교 분석하였다.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권10호
• /
• pp.593-602
• /
• 2004

정렬되지 않은 3차원 측정점들로부터 이들을 근사하는 표면을 재구성하는 방법을 제안하였다. 제안된 방법은 경계면 축소포장 방식에 의한 표면 재구성 방법(shrink-wrapped boundary face： SWBF) 으로, 측정점으로부터 경계셀과 경계면을 구해 초기 메쉬를 생성하고 이를 연속적으로 축소하는 방식에 의해 표면을 재구성한다. 제안된 방법은 기존의 표면 축소포장 방식의 메쉬 생성 방법의 문제점인 물체의 토폴로지에 대한 제약이 없이 어떠한 형태의 표면 재구성에도 적용이 가능하며, 기존 방법이 축소 단계에서 각 메쉬 정점에 대한 최단거리 측정점을 찾는 전역 탐색을 해야 하는데 비해 지역 탐색만으로 최적의 측정점을 찾을 수 있으므로 처리 시간 측면에서도 우월하다. 실험을 통해 제안된 표면 재구성 알고리즘이 측정점들간의 관계를 알 수 없는 정렬되지 않은 3차원 점들에 대한 표면 재구성에 매우 안정적이고 효과적임을 확인할 수 있었다.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제52권6호
• /
• pp.247-253
• /
• 2003

A novel finite element mesh regeneration method is presented for 3D shape optimization of electromagnetic devices. The method has its theoretical basis in the structural deformation of an elastic body. When the shape of the electromagnetic devices changes during the optimization process, a proper 3D finite element mesh can be easily obtained using the method from the initial mesh. For real engineering problems, the method guarantees a smooth shape with proper mesh quality, and maintains the same mesh topology as the initial mesh. Application of the optimum design of an electromagnetic shielding plate shows the effectiveness of the presented method.

• Journal of Mechanical Science and Technology
• /
• 제20권12호
• /
• pp.2034-2042
• /
• 2006

In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.