• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.24 no.6
• /
• pp.462-469
• /
• 2014

After drilling operations at the offshore plant, crude oil is producted under high pressure. After that time, oil recovery is reduced, because the pressure of the pipe inside is low during the secondary produce. At that time injection sea water at the pipe inside through water injection pump that the device increase to recovery. A variety of mathematical analysis during the detailed design analysis was not made through the dynamics characteristic at the domestic company. 2D model has reliability of analysis results for the uncomplicated model. Also element and the node the number of significantly less than in the 3D model. So, the temporal part is very effective. In addition, depending on the quality of mesh 3D is a real model and FEM model occurs error. So, user needs a lot of skill. In this paper, a 2D finite element analysis was performed through the dynamics analysis and the study model was validated.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1089-1092
• /
• 1999

Applications using 3D models are increasing recently. Since 3D polygonal models are structured by a triangular mesh, the coding of polygonal models in strips of triangles is an efficient way of representing the data. These strips may be very long, and may take a long time to render or transmit. If the triangle strips are partitioned, it may be possible to perform more efficient data transmission in an error-prone environment and to display the 3D model progressively. In this paper, we devised the Component Based Data Partitioning (CODAP) which is based on Topological Surgery (TS). In order to support the error resilience and the progressively build-up rendering, we partition the connectivity, geometry, and properties of a 3D polygonal model. Each partitioned component is independently encoded and resynchronization between partitioned components is done.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.361-364
• /
• 2004

This paper describes an automatic 3D models generation algorithm based on 2D silhouette images, using X-ray camera without camera parameters. The algorithm takes a multi steps process approach. First, a series of 2D silhouette images is captured from different directions of object and then converted to binary images. An octree data structure is constructed for voxel-based representation of object. An estimate 3D volume of object can be reconstructed by intersecting voxels and the 2D silhouettes. The marching cube algorithm is applied to get triangle mesh representing of the obtained 3D model for rendering.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.3
• /
• pp.155-166
• /
• 2017

As the utilization of aerial images increases, a variety of software using unmanned aerial photogrammetric procedures as well as traditional aerial photogrammetric procedures are being provided. Previously, software that used the unmanned aerial photogrammetric procedure was used for images captured in small areas. Recently, however, software that uses unmanned aerial photogrammetric procedures for large-scale images taken by using aerial photogrammetric cameras has appeared. Therefore, this study generated ortho-images using aerial photogrammetry and unmanned aerial photogrammetry for large aerial images, and compared the features of both procedures through qualitative and quantitative comparisons. Experiments in the study area show that using the 3D mesh effectively removes the relief displacement of the building rather than using the digital surface model to generate ortho-images.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.935-937
• /
• 1993

This paper presents a three dimensional automatic mesh generation scheme for the boundary element method, and this scheme can be applicable to practical problems of complex shape. The geometry of the problem is expressed as an assemblage of linear Coon's surfaces, and each surface is made up of four edge curves which are defined in the form of a parametric function. Curves are automatically segmented according to their characteristics. With these segments of curves, interior points and triangular mesh elements are generated in the parametric plane using Lindholm's method, and then their projection on the real surface forms the initial mesh. The refinement of initial mesh is performed so that the discrete triangular planes are close to the real continuous surfaces. The bisection method is used for the refinement. Finally, interior points in the refined mesh are rearranged so as to make each element be close with an equilateral triangle. An attempt has been made to apply the proposed method to a DY(Deflection Yoke) model.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.133-140
• /
• 2007

The SWBF(shrink-wrapped boundary face) algorithm is a recent mesh reconstruction method for constructing a surface model from a set of unorganized 3D points. In this paper, we point out the surface duplication problem of SWBF and propose an improved mesh reconstruction scheme. Our method tries to classify the non-boundary cells as the inner cell or the outer cell, and makes an initial mesh without surface duplication by adopting the improved boundary face definition. To handle the directional unbalance of surface sampling density arise in typical 3D scanners, two dimensional connectivity in the cell image is introduced and utilized. According to experiments, our method is proved to be very useful to overcome the surface duplication problem of the SWBF algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.30 no.3
• /
• pp.161-171
• /
• 1994

Mesh selection analysis for the trawl net were carried out at the Southern Korean Sea and the East China Sea during the 1992-1994 years by the training ship Seabada of the National Fisheries University of Pusan, using A type (51.2mm), B type (70.2mm), C type (77.6mm), D type (88.0mm) square mesh cod-ends. The fishing trials were made using bottom trawl of the trouser type cod-end with cover net. Selection curves and selection parameters were calculated by a logistic model for Sphyraena pinguis, Pampus argenteus, Trachurus japonicus, Pagrus major, Callanthias japonicus, Trichiurus lepturus. The results obtained are summarized as follows: 1. Red barracuda : Selection range and fifty percent selection length in the A type was 115.8mm, 292.8mm, respectively. 2. Harvest fish : Each selection range and fifty percent selection length in the B. C. and D type was 37.7mm, 113.8mm : 40.1mm, 131.7mm and 64.8mm, 148.6mm, respectively. Selection parameters of master curve were : slope, 3.81 : intercept, -6.4. Optimum mesh size was 89.3mm. 3. Horse mackerel : Each selection range and fifty percent selection length in the A, B, C and D type was 43.0mm, 148.3mm : 60.7mm, 183.2mm, 214.5mm and 91.4mm, 254.9mm, respectively. Selection parameters of master curve were : slope 2.30 : intercept, -6.4. Optimum mesh size was 66.8mm. 4. Red seabrem : Selection range and fifty percent selection length in the D type was 42.7mm, 203.4mm, respectively. 5. Yellowsail red bass : Selection range and fifty percent selection length in the A type was 84.0mm, 110.6mm, respectively. 6. Hair tail : Each selection range and fifty percent selection length in the A, B and C type was 59.7mm, 176.0mm : 100.9mm, 250.7mm and 178.6mm, 307.0mm, respectively. Selection parameters of master curve were : slope, 1.54 : intercept, -5.4. Optimum mesh size was 57.5mm.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.669-672
• /
• 2009

The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Most similarity search techniques focus on comparisons of each individual 3D model from databases. However, our similarity search technique can compare not only each individual 3D model, but also partial shape similarities. The partial shape matching technique extends the user's query request by finding similar parts of 3D models and finding 3D models which contain similar parts. We have implemented an experimental partial shape-matching search system for 3D pagoda models, and preliminary experiments show that the system successfully retrieves similar 3D model parts efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4042-4059
• /
• 2020

The development of new multimedia techniques such as 3D printing is increasingly attracting the public's attention towards 3D objects. An optimized robust and imperceptible watermarking method based on Ant Colony Optimization (ACO) and Weber Law is proposed for 3D polygonal models. The proposed approach partitions the host model into smaller sub meshes and generates a secret watermark from the sub meshes using Weber Law. ACO based optimized strength factor is identified for embedding the watermark. The secret watermark is embedded and extracted on the wavelet domain. The proposed scheme is robust against geometric and photometric attacks that overcomes the synchronization problem and authenticates the secret watermark from the distorted models. The primary characteristic of the proposed system is the flexibility achieved in data embedding capacity due to the optimized strength factor. Extensive simulation results shows enhanced performance of the recommended framework and robustness towards the most common attacks like geometric transformations, noise, cropping, mesh smoothening, and the combination of such attacks.