• Korean Journal of Computational Design and Engineering
• /
• v.9 no.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/.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.5
• /
• pp.535-541
• /
• 2010

In this paper, we have derived a continuum-based adjoint design sensitivity of general performance functionals with respect to Young' modulus and heat conduction coefficient for steady-state nonlinear thermoelastic problems. An adjoint equation for temperature and displacement fields is defined for the efficient computation of the coupled field design sensitivity. Through numerical examples, we investigated the mesh dependency of the topology optimization method in the thermoelastic problems. Also, comparing the dominant loading cases of thermal and mechanical ones, the loading dependency of topology design optimization in coupled multi-physics problems is investigated.

• ETRI Journal
• /
• v.39 no.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.

• Proceedings of the IEEK Conference
• /
• summer
• /
• 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
• /
• v.75 no.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.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.663-672
• /
• 2007

This paper proposes an algorithm for design of a multiple ring network that can be applied to an arbitrary topology in the WDM optical transport networks. Especially, we suggest an integer linear program(ILP) formulation with the objective of minimizing the total cost of nodes based on the reconfigurable OADM(ROADM) architecture and propose a heuristic algorithm to reduce computational complexity of the exact problem formulation. To evaluate the performance and validity of this scheme, we applied it to an NSFnet topology assuming the dynamic or static traffic condition and compared it with a mesh methodology about capacity of connection requests and the total cost of the nodes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.593-602
• /
• 2004

A new surface reconstruction scheme for approximating the surface from a set of unorganized 3D points is proposed. Our method, called shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. Proposed method surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique, and can be applicable to any kind of surface topology. Furthermore, SWBF is much faster than the previous one since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.52 no.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
• /
• v.20 no.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.