Searcharxiv⌕ Search

arXiv subjects

Kenjiro T. Miura

Publications and source records attributed to Kenjiro T. Miura.

8 recordsLinked to original sources

Fairing of planar curves to log-aesthetic curves

We present an algorithm to fair a given planar curve by a log-aesthetic curve (LAC). We show how a general LAC segment can be uniquely characterized by seven parameters and present a method of parametric approximation based on this fact. This work aims to provide tools to be used in reverse engineering for computer aided geometric design. Finally, we show an example of usage by applying this algorithm to the point data obtained from 3D scanning a car's roof.

math.NA↗

Log-Aesthetic Curves: Similarity Geometry, Integrable Discretization and Variational Principles

In this paper, we consider a class of plane curves called log-aesthetic curves and their generalization which are used in computer aided geometric design. We consider these curves in the framework of the similarity geometry and characterize them as invariant curves under the integrable flow on plane curves which is governed by the Burgers equation. We propose a variational principle for these curves, leading to the stationary Burgers equation as the Euler-Lagrange equation. As an application of the formulation developed here, we propose a discretization of these curves and the associated variational principle which preserves the underlying integrable structure. We finally present algorithms for the generation of discrete log-aesthetic curves for given ${\rm G}^1$ data based on the similarity geometry. Our method is able to generate $S$-shaped discrete curves with an inflection as well as $C$-shaped curves according to the boundary condition. The resulting discrete curves are regarded as self-adaptive discretization and thus high-quality even with a small number of points.

nlin.SI↗

Log-aesthetic Curves as Similarity Geometric Analogue of Euler's Elasticae

In this paper we consider the log-aesthetic curves and their generalization which are used in CAGD. We consider those curves under similarity geometry and characterize them as stationary integrable flow on plane curves which is governed by the Burgers equation. We propose a variational formulation of those curves whose Euler-Lagrange equation yields the stationary Burgers equation. Our result suggests that the log-aesthetic curves and their generalization can be regarded as the similarity geometric analogue of Euler's elasticae.

nlin.SI↗

MC-curves and aesthetic measurements for pseudospiral curve segments

This article studies families of curves with monotonic curvature function (MC-curves) and their applications in geometric modelling and aesthetic design. Aesthetic analysis and assessment of the structure and plastic qualities of pseudospirals, which are curves with monotonic curvature function, are conducted for the first time in the field of geometric modelling from the position of technical aesthetics laws. The example of car body surface modelling with the use of aesthetics splines is given.

cs.GR↗

On the variety of planar spirals and their applications in computer aided design

In this paper we discuss the variety of planar spiral segments and their applications in objects in both the real and artificial world. The discussed curves with monotonic curvature function are well-known in geometric modelling and computer aided geometric design as fair curves, and they are very significant in aesthetic shape modelling. Fair curve segments are used for two-point G1 and G2 Hermite interpolation, as well as for generating aesthetic splines.

cs.GR↗

The Logarithmic Curvature Graphs of Generalised Cornu Spirals

The Generalized Cornu Spiral (GCS) was first proposed by Ali et al. in 1995 [9]. Due to the monotonocity of its curvature function, the surface generated with GCS segments has been considered as a high quality surface and it has potential applications in surface design [2]. In this paper, the analysis of GCS segment is carried out by determining its aesthetic value using the log curvature Graph (LCG) as proposed by Kanaya et al.[10]. The analysis of LCG supports the claim that GCS is indeed a generalized aesthetic curve.

cs.GR↗

An Improvised Algorithm to Identify The Beauty of A Planar Curve

An improvised algorithm is proposed based on the work of Yoshimoto and Harada. The improvised algorithm results a graph which is called LDGC or Logarithmic Distribution Graph of Curvature. This graph has the capability to identify the beauty of monotonic planar curves with less effort as compared to LDDC by Yoshimoto and Harada.

cs.GR↗