Fairing of discrete planar curves to integrable discrete analogue of Euler’s elasticae
نویسندگان
چکیده
We construct a method for fairing given discrete planar curve by using the integrable analog of Euler’s elastica, which is version approximation algorithm presented Brander et al. first give brief review elastica proposed Bobenko and Suris, then we present detailed account algorithm, apply this to an architectural problem characterizing keylines Japanese handmade pantiles.
منابع مشابه
Discrete Fairing
We address the general problem of, given a triangular net of arbitrary topology in IR 3 , nd a re ned net which contains the original vertices and yields an improved approximation of a smooth and fair interpolating surface. The (topological) mesh re nement is performed by uniform subdivision of the original triangles while the (geometric) position of the newly inserted vertices is determined by...
متن کاملThe integrable dynamics of discrete and continuous curves
We show that the following geometric properties of the motion of discrete and continuous curves select integrable dynamics: i) the motion of the curve takes place in the N dimensional sphere of radius R, ii) the curve does not stretch during the motion, iii) the equations of the dynamics do not depend explicitly on the radius of the sphere. Well known examples of integrable evolution equations,...
متن کاملDiscrete Local Fairing of B-Spline Surfaces
Many surfaces can be modeled by interpolating data points digitized from existing products. But the digitized data points could have measuring errors. To adjust the points, fairing is performed. We present an automatic local fairing algorithm using nonlinear programming. For the objective function of the algorithm, we derive discrete fairness metrics. The metrics are consisted of discrete princ...
متن کاملDiscrete Smooth Interpolation: Constrained Discrete Fairing for Arbitrary Meshes
In this paper, it is shown how the Discrete Smooth Interpolation method (D.S.I.) may be used as a new framework for creating, fairing and editing triangulated surfaces. Given an arbitrary mesh with an arbitrary set of vertices fixed by the user, D.S.I. assigns coordinates to the other nodes of the mesh, enabling the fixed vertices to be interpolated smoothly. The squared discrete Laplacian crit...
متن کاملDiscrete Moving Frames and Discrete Integrable Systems
Group-based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision. Here we describe what we call a discrete group-based moving frame, which is essentially a sequence of moving frames with overlapping domains. We demonstrate a small set of generators of the algebra of invariants, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of mathematics for industry
سال: 2023
ISSN: ['2661-3352', '2661-3344']
DOI: https://doi.org/10.1142/s2661335222500071