• Title/Summary/Keyword: triangle mesh

Search Result 82, Processing Time 0.022 seconds

Geodesics-based Shape-preserving Mesh Parameterization (직선형 측지선에 기초한 원형보전형 메쉬 파라미터화)

  • 이혜영
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.7
    • /
    • pp.414-420
    • /
    • 2004
  • Among the desirable properties of a piecewise linear parameterization, guaranteeing a one-to-one mapping (i.e., no triangle flips in the parameter plane) is often sought. A one-to-one mapping is accomplished by non-negative coefficients in the affine transformation. In the Floater's method, the coefficients were computed after the 3D mesh was flattened by geodesic polar-mapping. But using this geodesic polar map introduces unnecessary local distortion. In this paper, a simple variant of the original shape-preserving mapping technique by Floater is introduced. A new simple method for calculating barycentric coordinates by using straightest geodesics is proposed. With this method, the non-negative coefficients are computed directly on the mesh, reducing the shape distortion introduced by the previously-used polar mapping. The parameterization is then found by solving a sparse linear system, and it provides a simple and visually-smooth piecewise linear mapping, without foldovers.

Real-Time GPU Technique for Extracting Mesh Isosurfaces from BCC Volume Datasets (BCC 볼륨 데이터로부터 실시간으로 메시 형태의 등가면을 추출하는 GPU 기법)

  • Kim, Hyunjun;Kim, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.26 no.4
    • /
    • pp.17-26
    • /
    • 2020
  • We present a real-time GPU(Graphic Processing Unit) marching tetrahedra technique that extracts isosurfaces in the indexed mesh format from BCC(Body Centered Cubic) volume datasets. Compared to classical marching tetrahedra, our method shows better performance with little memory overhead. Our technique is composed of five stages. In the first stage, which needs to be done only once, we build min/max blocks that is to be used for empty space skipping to boost the performance. Next, we extract active blocks that contain the current isovalue. In the next two stages, we extract the edges and cells that contain the isosurface and then the final triangular mesh is generated in the last stage. When applied 5123 or higher resolution volume dataset, our technique shows up to 5 times speed improvement compared to the classical marching tetrahedra algorithm.

A Novel Method for 3D Surface and Solid Construction Analysis of Fabric Microstructure (직물 미세구조의 3차원 표면 및 솔리드 형성 방법)

  • Lee, Ye-Jin;Lee, Byung-Cheol
    • Korean Journal of Human Ecology
    • /
    • v.21 no.3
    • /
    • pp.539-550
    • /
    • 2012
  • In-depth knowledge of fabric microstructure is essential for understanding clothing comfort since it plays a significant role in heat and mass transfer between the human body and clothing. In this study, a novel method was employed for investigating 3D surfaces and solid construction characteristics of specific fabrics by using a reverse engineering technique. The surface construction data were obtained by a confocal laser scanning microscope and then manipulated by a 3D analysis program. Triangle mesh was used for connecting each 3D point, with clouds and fabric surface characteristics created by rendering techniques. For generating a 3D solid model, determinants of radius of curvature was used. According to the proposed method, actual surface expression of the real fabric was achieved successfully. The results from this methodology can be applied to the detailed analysis of clothing comfort that is highly influenced by the microstructure of the fabric.

Texture-based Hatching for Color Image and Video

  • Yang, Hee-Kyung;Min, Kyung-Ha
    • 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.

A RENDERING ALGORITHM FOR HYBRID SCENE REPRESENTATION

  • Tien, Yen;Chou, Yun-Fung;Shih, Zen-Chung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.17-22
    • /
    • 2009
  • In this paper, we discuss two fundamental issues of hybrid scene representation: constructing and rendering. A hybrid scene consists of triangular meshes and point-set models. Consider the maturity of modeling techniques of triangular meshes, we suggest that generate a point-set model from a triangular mesh might be an easier and more economical way. We improve stratified sampling by introducing the concept of priority. Our method has the flexibility that one may easily change the importance criteria by substituting priority functions. While many works were devoted to blend rendering results of point and triangle, our work tries to render point-set models and triangular meshes as individuals. We propose a novel way to eliminate depth occlusion artifacts and to texture a point-set model. Finally, we implement our rendering algorithm with the new features of the shader model 4.0 and turns out to be easily integrated with existing rendering techniques for triangular meshes.

  • PDF

An Arrangement Technique for Fine Regular Triangle Grid of Network Dome by Using Harmony Search Algorithm (화음탐색 알고리즘을 이용한 네트워크 돔의 정삼각형 격자 조절기법)

  • Shon, Su-Deok;Jo, Hye-Won;Lee, Seung-Jae
    • Journal of Korean Association for Spatial Structures
    • /
    • v.15 no.2
    • /
    • pp.87-94
    • /
    • 2015
  • This paper aimed at modeling a fine triangular grid for network dome by using Harmony Search (HS) algorithm. For this purpose, an optimization process to find a fine regular triangular mesh on the curved surface was proposed and the analysis program was developed. An objective function was consist of areas and edge's length of each triangular and its standard deviations, and design variables were subject to the upper and lower boundary which was calculated on the nodal connectivity. Triangular network dome model, which was initially consist of randomly irregular triangular mesh, was selected for the target example and the numerical result was analyzed in accordance with the HS parameters. From the analysis results of adopted model, the fitness function has been converged and the optimized triangular grid could be obtained from the initially distorted network dome example.

p-Adaptive Mesh Refinement of Plate Bending Problem by Modified SPR Technique (수정 SPR 기법에 의한 휨을 받는 평판문제의 적응적 p-체눈 세분화)

  • Jo, Jun-Hyung;Lee, Hee-Jung;Woo, Kwang-Sung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.481-486
    • /
    • 2007
  • The Zienkiewicz-Zhu(Z/Z) error estimate is slightly modified for the hierarchical p-refinement, and is then applied to L-shaped plates subjected to bending to demonstrate its effectiveness. An adaptive procedure in finite element analysis is presented by p-refinement of meshes in conjunction with a posteriori error estimator that is based on the superconvergent patch recovery(SPR) technique. The modified Z/Z error estimate p-refinement is different from the conventional approach because the high order shape functions based on integrals of Legendre polynomials are used to interpolate displacements within an element, on the other hand, the same order of basis function based on Pascal's triangle tree is also used to interpolate recovered stresses. The least-square method is used to fit a polynomial to the stresses computed at the sampling points. The strategy of finding a nearly optimal distribution of polynomial degrees on a fixed finite element mesh is discussed such that a particular element has to be refined automatically to obtain an acceptable level of accuracy by increasing p-levels non-uniformly or selectively. It is noted that the error decreases rapidly with an increase in the number of degrees of freedom and the sequences of p-distributions obtained by the proposed error indicator closely follow the optimal trajectory.

  • PDF

Precise Sweep Volume Computation Accelerated by GPU (GPU 가속을 이용한 정밀밀한 스웹 볼륨 경계 계산)

  • Lee, Hyunho;Kyung, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.1
    • /
    • pp.13-21
    • /
    • 2015
  • We present a robust GPU algorithm constructing a sweep volume boundary for a triangular mesh model. Sweeping geometric entities of a triangular mesh object is first approximated to a set of triangles, the envelope of which becomes the outer boundary of the sweep volume. We find the envelope by computing the arrangement of the triangle set and extracting its outmost boundary. To ensure robustness of the algorithm, we adopt random perturbation of sweep vertices and the interval arithmetic using multi-level precisions. The algorithm is implemented to perform most computation on GPU, and as a result it runs two orders of magnitude faster than other algorithms.

Modeling and Analysis of Arbitrarily Shaped Three-Dimensional Cracks (임의 형태의 삼차원 균열 모델링 및 해석)

  • Park, Jai-Hak;Nikishkov, G.P.
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.9
    • /
    • pp.1091-1097
    • /
    • 2011
  • The SGBEM-FEM alternating method has been known to be a very effective method for analyzing threedimensional cracks in a finite body. The accurate values of the stress intensity factor can be obtained for a general planar or nonplanar three-dimensional crack. In the existing method, eight-noded quadrilateral boundary elements are used to model a crack. In some cases, three-node triangle boundary elements are more convenient for the modeling of a crack with a general shape. In this study, a crack is modeled with three-noded triangular and seven-noded quadrilateral elements by using the advancing-front mesh generation method. The stress intensity factors are obtained for cracks with several shapes and the accuracy of results is examined.

Development of Generating Technique for Triangular Mesh by using Distinct Element Method (개별요소법을 이용한 삼각망 생성기법 개발)

  • Kim, Nam-Hyeong;Yun, Hyeon-Cheol;Hur, Young-Teck
    • Journal of Navigation and Port Research
    • /
    • v.34 no.5
    • /
    • pp.367-373
    • /
    • 2010
  • When the numerical analysis is carried out, it is necessary to set proper elements as a feature of analysis domains for more accurate simulations. In this study, Distinct Element Method(DEM) is applied, only considering repulsive force and tensile force except for frictional force and resisting force of particle. When the filled particles with initial Quad-tree type is relocated by DEM, a blank space existing among the particles can be minimized because the shape of particle is circular. Finally, it is the effective feature that the centroidal disposion of the particles is similar to an equilateral triangle. Triangular mesh are formed by using the Delaunay triangular technique on these relocated particles, the quality of triangular mesh is more improved by carrying out Laplace interpolations. The compared result of Aspect Ratio before and after the Laplace interpolation is shown that although the quality of triangular mesh made by DEM is good, the later triangular mesh are higher quality than the formers. In this study, although the developed technique takes a longer calculational time than the previous technique to generate triangular mesh, it is considered that the applicable possibility is very high in the generation of finite element mesh about wave analysis and various numerical simulation to need a complex or reappearance of exact topography.