• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.17 no.3
• /
• pp.78-86
• /
• 2018

The 3D mesh model is used in various fields, such as virtual reality, shape-based searching, 3D simulation, reverse engineering, 3D printing, and laser scanning. There are various formats for the 3D mesh model, but STL and OBJ are the most typical. Since application systems support different 3D mesh formats, developing technology for converting 3D mesh models from one format into another is necessary to ensure data interoperability among systems. In this paper, we propose a method to convert a 3D mesh model in STL format into the OBJ format. We performed the basic design of the conversion system and developed a prototype, then verified the proposed method by experimentally converting an STL file into an OBJ file for test cases using this prototype.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.347-358
• /
• 2000

The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

• Journal of computational fluids engineering
• /
• v.9 no.4
• /
• pp.7-12
• /
• 2004

In the present study a semi-automatic mesh generation program has been developed by using DXF file containing contour line data. The program consists of DXF file reader and mapping algorithm. Pre-generated 2-D planar mesh points are to be mapped one by one onto triangular surface whose three vertices are three nearest contour points surrounding the mapping point. The present program has been successfully tested for mesh generations for the road tunnel ventilation analysis and analysis of lava movement in mountain area.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.4
• /
• pp.174-181
• /
• 1999

To obtain more accurate result in the finite element analysis for electric machinery, it is important to have a mesh being of good quality. This paper describes a new technique of mesh generation for the finite element method. When the list of points defining the region of analysis is given, an appropriate distribution of interior points is generated first. Secondly the points are connected to from the trianlges. Finally the connectivity data are used to reposition the interior points using Laplacian smoothing and mesh relaxation technique. In this paper, a mesh searching technique of Lawson which modifies the start mesh is proposed in addition to the above three steps. This algorithm is simple and produces the meshes being of good quality with high speed in comparison with the existing one.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.65-73
• /
• 1997

This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.778-785
• /
• 2020

Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.270-277
• /
• 2003

In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.37 no.2
• /
• pp.21-30
• /
• 1995

In order to save time and efforts in generating finite element meshes in irregular houndaries of domains, it is needed to develop an automatic mesh-generator which can hoth promote the accuracy of solutions and reduce the run-time in operating finite ele- ment models. In this study, the advancing front technique of triangular mesh generation and the transforming technique from triangular meshes to quadrilateral meshes were used to de- velop a computer program for the automatic triangular and quadrilateral meshes in the mixed shape. Furthermore, to enhance the quadrilateral mesh quality, the techniques of Laplancian smoothing and interior mesh modification were employed. The mesh genera- tor was applied to evaluate its applicability to irregular and complex geometries such as Nakdong river bay. In has hoen shown that the automatic mesh generator developed is capable of automatically generating meshes for irreguiar and complex geometries with high qualities of meshes and with the simple input data of arbitrarily specified nodal spacing in bound- aries.