• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.53-60
• /
• 2010

The concept of discrete curvature is a discretization of the curvature. Many literatures introduce discrete curvatures derived from arc length of circular arcs. We propose a new concept of discrete curvature of a polygon at each vertex, which is derived from area of fan shapes. We estimate the error of the discrete curvature and compare the discrete curvature with old one.

• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.487-504
• /
• 2015

For a smooth plane curve, the curvature can be characterized by the rate of change of the angle between the tangent vector and a fixed vector. In this article we prove that the curvature of a space curve can also be given by the rate of change of the locally defined angle between the tangent vector at a point and the nearby point. By using height functions, we introduce turning angle of a space curve and characterize the curvature by the rate of change of the turning angle. The main advantage of the turning angle is that it can be used to characterize the curvature of discrete curves. For this purpose, we introduce a discrete turning angle and a discrete curvature called visual curvature for space curves. We can show that the visual curvature is an approximation of curvature for smooth curves.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.235-246
• /
• 2005

We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original(in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.1
• /
• pp.37-53
• /
• 2021

In this paper we define scaled visual curvature and visual Frenet frame that can be visually accepted for discrete space curves. Scaled visual curvature is relatively simple compared to multi-scale visual curvature and easy to control the influence of noise. We adopt scaled minimizing directions of height functions on each neighborhood. Minimizing direction at a point of a curve is a direction that makes the point a local minimum. Minimizing direction can be given by a small noise around the point. To reduce this kind of influence of noise we exmine the direction whether it makes the point minimum in a neighborhood of some size. If this happens we call the direction scaled minimizing direction of C at p ∈ C in a neighborhood Br(p). Normal vector of a space curve is a second derivative of the curve but we characterize the normal vector of a curve by an integration of minimizing directions. Since integration is more robust to noise, we can find more robust definition of discrete normal vector, visual normal vector. On the other hand, the set of minimizing directions span the normal plane in the case of smooth curve. So we can find the tangent vector from minimizing directions. This lead to the definition of visual tangent vector which is orthogonal to the visual normal vector. By the cross product of visual tangent vector and visual normal vector, we can define visual binormal vector and form a Frenet frame. We examine these concepts to some discrete curve with noise and can see that the scaled visual curvature and visual Frenet frame approximate the original geometric invariants.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.1
• /
• pp.89-95
• /
• 2006

The local geometric properties such as curvatures and normal vectors play important roles for analyzing the local shape of objects in the fields of computer graphics and computer vision. The result of the geometric operations such as mesh simplification and mesh smoothing is dependent on how to compute the curvatures of meshes because there is no exact mathematical definition of curvature at vertices on 3D meshes. Therefore, In this paper, we indicate the fatal error in computing the sectional curvatures of the most previous discrete curvature estimations. Moreover, we present a discrete curvature estimation to overcome the error, which is based on the parabola interpolation and the geometric properties of Bezier curves. Therefore, We can well distinguish between the sharp vertices and the flat ones, so our method may be applied to a variety of geometric operations.

• Journal of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.113-125
• /
• 2019

In this paper, we consider the Ricci curvature of a directed graph, based on Lin-Lu-Yau's definition. We give some properties of the Ricci curvature, including conditions for a directed regular graph to be Ricci-flat. Moreover, we calculate the Ricci curvature of the cartesian product of directed graphs.

• 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.

• Honam Mathematical Journal
• /
• v.38 no.2
• /
• pp.359-366
• /
• 2016

Let H be the 3-dimensional Heisenberg group, ($G=H{\times}S^1$, g) a product Riemannian manifold of Riemannian manifolds H and S with arbitrarily given left invariant Riemannian metrics respectively, and ${\Gamma}$ the discrete subgroup of G with integer entries. Then, on the Riemannian manifold ($M:=G/{\Gamma}$, ${\Pi}^*g=\bar{g}$), ${\Pi}:G{\rightarrow}G/{\Gamma}$, we evaluate the scalar curvature and the Ricci curvature.

• Structural Engineering and Mechanics
• /
• v.43 no.2
• /
• pp.147-161
• /
• 2012

This paper presents a curvature method for analysis of beam-columns with different materials and arbitrary cross-section shapes and subjected to combined biaxial moments and axial load. Both material and geometric nonlinearities (the p-delta effect in this case) were incorporated. The proposed method considers biaxial curvatures and uniform normal strains of discrete cross-sections of beam-columns as basic unknowns, and seeks for a solution of the column deflection curve that satisfies force equilibrium conditions. A piecewise representation of the beam-column deflection curve is constructed based on the curvatures and angles of rotation of the segmented cross-sections. The resulting bending moments were evaluated based on the deformed column shape and the axial load. The moment curvature relationship and the beam-column deflection calculation are presented in matrix form and the Newton-Raphson method is employed to ensure fast and stable convergence. Comparison with results of analytic solutions and eccentric compression tests of wood beam-columns implies that this method is reliable and effective for beam-columns subjected to eccentric compression load, lateral bracings and complex boundary conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.441-460
• /
• 2016

We introduce the notions of h-v-semi-slant submersions and almost h-v-semi-slant submersions from almost quaternionic Hermitian manifolds onto Riemannian manifolds. We obtain characterizations, investigate the integrability of distributions, the geometry of foliations, and a decomposition theorem. We find a condition for such submersions to be totally geodesic. We also obtain an inequality of a h-v-semi-slant submersion in terms of squared mean curvature, scalar curvature, and h-v-semi-slant angle. Finally, we give examples of such maps.