• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.4
• /
• pp.196-220
• /
• 2021

This study formulates a new geometric parameterization scheme to effectively address numerical analysis subject to the variation of the fiber radius of a square unit cell. In particular, the proposed mesh-morphing approach may lead to a parameterized weak form whose bilinear and linear forms are affine in the geometric parameter of interest, i.e. the fiber radius. As a result, we may certify the reduced basis analysis of a square unit cell model for any parameters in a predetermined parameter domain with a rigorous a posteriori error bound. To demonstrate the utility of the proposed geometric parameterization, we consider a two-dimensional, steady-state heat conduction analysis dependent on two parameters: a fiber radius and a thermal conductivity. For rapid yet rigorous a posteriori error evaluation, we estimate a lower bound of a coercivity constant via the min-θ method as well as the successive constraint method. Compared to the corresponding finite element analysis, the constructed reduced basis analysis may yield nearly the same solution at a computational speed about 29 times faster on average. In conclusion, the proposed geometric parameterization scheme is conducive for accurate yet efficient reduced basis analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1377-1383
• /
• 2008

Parameterization of a 3D triangular mesh is a fundamental problem in various applications of geometric modeling and computer graphics. There are two major paradigms in mesh parameterization: energy functional minimization and the convex combination approach. In general, the convex combination approach is wifely used because of simple concept and one-to-one mapping. However, the approach has some problems such as high distortion near the boundary and time complexity. Moreover, the stability of the linear system may not be preserved according to the geometric information of the mesh. In this paper, we present an extension of the convex combination approach based on the mean value coordinates, which resolves the drawbacks of the convex combination approach. This may be a more practical solution because it is able to generate a stable linear system in a short time.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.106-114
• /
• 2010

Mesh parameterization is the process of finding one-to-one mapping between an input mesh and a parametric domain. It has been considered as a fundamental tool for digital geometric processing which is required to develop several applications of digital geometries. In this paper, we propose a novel 3D volume parameterization by means that a harmonic mapping is established between a 3D volume mesh and a unit solid cube. To do that, we firstly partition the boundary of the given 3D volume mesh into the six different rectangular patches whose adjacencies are topologically identical to those of a surface cube. Based on the partitioning result, we compute the boundary condition as a precondition for computing a volume mesh parameterization. Finally, the volume mesh parameterization with a low-distortion can be accomplished by performing a harmonic mapping, which minimizes the harmonic energy, with satisfying the boundary condition. Experimental results show that our method is efficient enough to compute 3D volume mesh parameterization for several models, each of whose topology is identical to a solid sphere.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.11-20
• /
• 2009

The conventional methods of boundary-conformed 2D surfaces generation usually yield some problems. This paper deals with two boundary-conformed 2D surface generation methods, one conventional approach, the linear Coons method, and a new method, boundary-conformed interpolation. In this new method, unidirectional 2D surface has been generated using some of the geometric properties of the given boundary curves. A method of simultaneous displacement of the interpolated curves from the opposite boundaries has been adopted. The geometric properties considered for displacements include weighted combination of angle bisector and linear displacement vectors at all the data-points of the two opposite generating curves. The algorithm has one adjustable parameter that controls the characteristics of transformation of one set of curves from its parents. This unidirectional process has been extended to bi-directional parameterization by superimposing two sets of unidirectional curves generated from both boundary pairs. Case studies show that this algorithm gives reasonably smooth transformation of the boundaries. This algorithm is more robust than the linear Coons method and capable of resolving the 2D boundary-conformed parameterization problems.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2003

In this article, we consider a Bayesian estimation method for the geometric mean of $textsc{k}$ exponential parameters, Using the Tibshirani's orthogonal parameterization, we suggest an invariant prior distribution of the $textsc{k}$ parameters. It is seen that the prior, probability matching prior, is better than the uniform prior in the sense of correct frequentist coverage probability of the posterior quantile. Then a weighted Monte Carlo method is developed to approximate the posterior distribution of the mean. The method is easily implemented and provides posterior mean and HPD(Highest Posterior Density) interval for the geometric mean. A simulation study is given to illustrates the efficiency of the method.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.939-942
• /
• 2013

We provide a new solution for the projective reconstruction problem based on coupled line cameras (CLCs) and their geometric properties. The proposed solution is composed of a series of optimized steps, and each step is more efficient than those of the initial solution proposed in [1]. We also give a new determinant condition for rectangle determination, which leads to less ambiguity in implementation. The key steps of the proposed solution can be represented with more compact analytic equations due to the intuitive geometric interpretations of the projective reconstruction problem based on CLCs: the center of projection corresponds to the intersection point of the two solution circles of each line camera involved.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.3
• /
• pp.9-18
• /
• 2001

Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect features on a mesh.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.2
• /
• pp.181-190
• /
• 2007

The linkage framework of surface geometric modeling based on the NURBS and shell finite element analysis is developed in this study. In the geometrically exact shell finite element analysis, the accuracy of the analysis strongly depends upon the accurate computation of the surface geometric quantities. Therefore if we obtain the necessary geometric quantities from the NVRBS surface equation, it's possible to construct the effective linkage framework of surface modeling in the CAD systems and shell finite element analysis using geometrically exact shell finite element. Besides, the linkage framework can be applied to the analysis of general and complex surfaces as well as simple surfaces. In this study, the shell surfaces are generated by interpolating given set of data points based on the NURBS surfaces. These data points usually can be obtained from surface scanning. But the representations of the generated NURBS surface are not same to one another. The accuracy depends on the chosen parameterization methods used in NURBS. Therefore, it is needed to select the suitable parameterization method according to the geometry of the surfaces. To verify the performance and accuracy of our developed linkage framework, we solve several well-known benchmark problems and assess the performance of the developed method.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.6
• /
• pp.189-196
• /
• 2003

The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate points are sampled on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then, mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.405-413
• /
• 2004

Rational parameterization of curves and surfaces is one of the main topics in computer-aided geometric design because of their computational advantages. Pythagorean hodograph (PH) curves and Minkowski Pythagorean hodograph (MPH) curves have attracted many researcher's interest because they provide for rational representation of their offset curves in Euclidean space and Minkowski space, respectively. In [10], Kim presented the characterization of the PH curves in the Euclidean space and analyzed the relation between the class of PH curves and the class of rational curves. In this paper, we extend the characterization of PH curves in [10] into that of MPH curves in the general Minkowski space and consider some generalized MPH curves satisfying this characterization.