• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.245-254
• /
• 2000

This paper proposes a new discrete curvature error metric to generate LOD meshes. For mesh simplification, discrete curvatures are defined with geometric attributes, such as angles and areas of triangular polygonal model, and dihedral angles without any smooth approximation. They can represent characteristics of polygonal surface well. The new error metric based on them, discrete curvature error metric, increases the accuracy of simplified model by preserving the geometric information of original model and can be used as a global error metric. Also we suggest that LOD should be generated not by a simplification ratio but by an error metric. Because LOD means the degree of closeness between original and each level's simplified model. Therefore discrete curvature error metric needs relatively more computations than known other error metrics, but it can efficiently generate and control LOD meshes which preserve overall appearance of original shape and are recognizable explicitly with each level.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.288-296
• /
• 2004

This paper proposes a new mesh simplification algorithm using differential error metric. Many simplification algorithms make use of a distance error metric, but it is hard to measure an accurate geometric error for the high-curvature region even though it has a small distance error measured in distance error metric. This paper proposes a new differential error metric that results in unifying a distance metric and its first and second order differentials, which become tangent vector and curvature metric. Since discrete surfaces may be considered as piecewise linear approximation of unknown smooth surfaces, theses differentials can be estimated and we can construct new concept of differential error metric for discrete surfaces with them. For our simplification algorithm based on iterative edge collapses, this differential error metric can assign the new vertex position maintaining the geometry of an original appearance. In this paper, we clearly show that our simplified results have better quality and smaller geometry error than others.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.40-47
• /
• 2001

In reverse engineering, existing products are digitized fur the computer modeling. Using the digitized data, surfaces are modeled for new products. However, in the digitizing process measuring errors or deviations can be happened often in practice. Thus, it is important to adjust such errors or deviations during the computer modeling. To adjust the errors, fairing of the modeled surfaces is performed. In this paper, we present a surface fairing algorithm based on various fairness metrics. Fairness metrics can be discrete. We adopt discrete metrics for fairing given 3D point set. The fairness metrics include discrete principal curvatures. In this paper, automatic fairing process is proposed for fairing given 3D point sets for surfaces. The process uses various fairness criteria so that it is adequate to adopt designers'intents.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.3
• /
• pp.341-355
• /
• 2017

This paper is devoted to some dynamical properties such as transitivity, mixing and specification of two discrete dynamical systems (X, f) and ($2^X$, ${\bar{f}}$) on compact metric spaces.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.4
• /
• pp.330-340
• /
• 2002

In this Paper. a non-linear approach to a design of model reference adaptive control is presented. The approach is demonstrated by a case study of a simple single-pole and no zero, linear, discrete-time plant. The essence of the idea is to generate a full non-linear model of the plant dynamics and the parameter adaptation dynamics as a gradient descent algorithm with respect to a Riemannian metric. It is shown how a Riemannian metric can be chosen so that the modelled plant dynamics do in fact match the true plant dynamics. The performance of the proposed scheme is compared to a traditional model reference adaptive control scheme using the classical sensitivity derivatives (Euclidean gradients) for the descent algorithm.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.981-989
• /
• 2019

In this paper we deal with some shadowing properties of discrete dynamical systems on a compact metric space via the density of subdynamical systems. Let $f:X{\rightarrow}X$ be a continuous map of a compact metric space X and A be an f-invariant dense subspace of X. We show that if $f{\mid}_A:A{\rightarrow}A$ has the periodic shadowing property, then f has the periodic shadowing property. Also, we show that f has the finite average shadowing property if and only if $f{\mid}_A$ has the finite average shadowing property.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.733-746
• /
• 2023

Let (X, d) be a semimetric space. A permutation Φ of the set X is a combinatorial self similarity of (X, d) if there is a bijective function f : d(X × X) → d(X × X) such that d(x, y) = f(d(Φ(x), Φ(y))) for all x, y ∈ X. We describe the set of all semimetrics ρ on an arbitrary nonempty set Y for which every permutation of Y is a combinatorial self similarity of (Y, ρ).

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1361-1371
• /
• 2017

In this paper, we introduce a framework of (${\alpha},{\beta}$)-flows on triangulated manifolds with two and three dimensions, which unifies several discrete curvature flows previously defined in the literature.

• Kyungpook Mathematical Journal
• /
• v.49 no.3
• /
• pp.573-582
• /
• 2009

This paper is indented to explain a dynamics on homotopies on the compact metric space, by the envelopes of homotopies. It generalizes the notion of not only the envelopes of maps in discrete geometry ([3]), but the envelopes of flows in continuous geometry ([5]). Certain distinctions among the homotopy geometry, the ow geometry and the discrete geometry will be illustrated. In particular, it is shown that any ${\omega}$-limit set, as well as any attractor, for an envelope of homotopies is an empty set (provided the homotopies that we treat are not trivial), whereas it is nonempty in general in discrete case.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.625-639
• /
• 1996

A convex $RP^n$-structure on a smooth anifold M is a representation of M as a quotient of a convex domain $\Omega \subset RP^n$ by a discrete group $\Gamma$ of collineations of $RP^n$ acting properly on $\Omega$. When M is a closed surface of genus g > 1, then the equivalence classes of such structures form a moduli space $B(M)$ homeomorphic to an open cell of dimension 16(g-1) (Goldman [2]). This cell contains the Teichmuller space $T(M)$ of M and it is of interest to know what of the rich geometric structure extends to $B(M)$. In [3], a symplectic structure on $B(M)$ is defined, which extends the symplectic structure on $T(M)$ defined by the Weil-Petersson Kahler form.