• Computers and Concrete
• /
• v.2 no.6
• /
• pp.499-516
• /
• 2005

A composite model is used to represent the heterogeneity of plain concrete consisting of coarse aggregates, mortar matrix and the mortar-aggregate interface. The composite elements of plain concrete are modeled using triangular finite element units which have six interface nodes along the sides. Fracture is captured through a constitutive single branch softening-fracture law at the interface nodes, which bounds the elastic domain inside each triangular unit. The inelastic displacement at an interface node represents the crack opening or sliding displacement and is conjugate to the internodal force. The path-dependent softening behaviour is developed within a quasi-prescribed displacement control formulation. The crack profile is restricted to the interface boundaries of the defined mesh. No re-meshing is carried out. Solutions to the rate formulation are obtained using a mathematical programming procedure in the form of a linear complementary problem. An event by event solution strategy is adopted to eliminate solutions with simultaneous formation of softening zones in symmetric problems. The composite plain concrete model is compared to experimental results for the tensile crack growth in a Brazilian test and three-point bending tests on different sized specimens. The model is also used to simulate wedge-type shear-compression failure directly under the loading platen of a Brazilian test.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.5
• /
• pp.335-343
• /
• 2006

Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.5
• /
• pp.1-11
• /
• 2021

The purpose of our research is to efficiently deform a 3D models which is composed of a triangular mesh and a skeleton. We designed a novel inverse kinematics (IK) solver that calculates the updated positions of mesh vertices with fewer computing operations. Through our user interface, one or more markers are selected on the surface of the model and their target positions are set, then the system updates the positions of surface vertices to construct a deformed model. The IK solving process for updating vertex positions includes many computations for obtaining transformations of the markers, their affecting joints, and their parent joints. Many of these computations are often redundant. We precompute those redundant terms in advance so that the 3-nested loop computation structure was improved to a 2-nested loop structure, and thus the computation time for a deformation is greatly reduced. This novel IK solver can be adopted for efficient performance in various research fields, such as handling 3D models implemented by LBS method, or object tracking without any markers.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.35 no.6
• /
• pp.561-567
• /
• 2011

The inverse radiation analysis of a two-dimensional irregular configuration using unstructured triangular meshes is presented. In this study, an enclosure filled with an absorbing, emitting and scattering medium with diffusely emitting and reflecting opaque boundaries is considered. The finite volume method is applied to solve the radiative transfer equation in order to simulate the measured incident radiation values which are used as input data for the inverse analysis. The conjugate gradient method is adopted for the estimation of wall emissivities by minimizing the objective function at each iteration step. To verify the performance of the unstructured grid system, we compare the results with those using a structured grid system for the two-dimensional lopsided shape. The effect of measurement errors on the estimation accuracy is also investigated.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.153-159
• /
• 2012

For the construction of safe and clear urban environment, it is necessary that we identify the rubbish waste volume and we know the accuracy volume. In this paper, we proposed the algorithm computes the waste volume periodically for the way of waste repository standard. After stereo camera calibration, we obtained the point cloud on the surface of the object and took this as the input of the calculation algorithm of the object volume. We proposed the volume calculation algorithms based on the non-uniform triangular meshing methods and verified the validity of the algorithm through simulation and real experiments. The proposed algorithm can be used not only as the volume calculation of the waste repository but also as the general volume calculation of a three dimensional object.

• 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 Korea Computer Graphics Society
• /
• v.15 no.1
• /
• pp.1-6
• /
• 2009

This paper presents a new CIP method for unstructured mesh to reduce the numerical dissipation. To reflect precise physical characteristics, CIP method updates both the physical quantity and the derivative information. The proposed method uses the Finite Volume Method(FVM) to solve the non-advection term of CIP equation. And we performed several experiments to improve the accuracy of third-order interpolation. Our result shows that our algorithm has less numerical dissipation than that of linear advection solver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.763-781
• /
• 2011

We present a texture-based hatching technique for color images and video. Whereas existing approaches produce monochrome hatching effects in considering of triangular mesh models by applying strokes of uniform size, our scheme produces color hatching effects from photographs and video using strokes with a range of sizes. We use a Delaunay triangulation to create a mesh of triangles with sizes that reflect the structure of an input image. At each vertex of this triangulation, the flow of the image is analyzed and a hatching texture is then created with the same alignment, based on real pencil strokes. This texture is given a modified version of a color sampled from the image, and then it is used to fill all the triangles adjoining the vertex. The three hatching textures that accumulate in each triangle are averaged and the result of this process across all the triangles forms the output image. We can also add a paper texture effect and enhance feature lines in the image. Our algorithm can also be applied to video. The results are visually pleasing hatching effects similar to those seen in color pencil drawings and oil paintings.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.11
• /
• pp.865-873
• /
• 2013

In this paper, numerical methods for wrinkle prediction of thin membrane were studied by finite element analysis. Techniques using membrane and shell elements were applied for triangular membrane. In case of membrane element method, the wrinkling was accounted for by the wrinkle algorithm of property modification, which was implemented to ABAQUS as a user subroutine. In case of shell method, geometrically nonlinear post-buckling analysis was performed to obtain the wrinkle deformation explicitly. The wrinkling deformation was induced by seeding the mesh with a random geometric imperfection. The results were investigated focusing on the mesh convergence and the solution accuracy.