8,830 research outputs found
Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory
subdivision. For arbitrarily spaced, planar input data an efficient non-linear
subdivision algorithm is presented that results in limit curves,
reproduces conic sections and respects the convexity properties of the initial
data. Significant numerical examples illustrate the effectiveness of the
proposed method
H\"older Regularity of Geometric Subdivision Schemes
We present a framework for analyzing non-linear -valued
subdivision schemes which are geometric in the sense that they commute with
similarities in . It admits to establish
-regularity for arbitrary schemes of this type, and
-regularity for an important subset thereof, which includes all
real-valued schemes. Our results are constructive in the sense that they can be
verified explicitly for any scheme and any given set of initial data by a
universal procedure. This procedure can be executed automatically and
rigorously by a computer when using interval arithmetics.Comment: 31 pages, 1 figur
Bivariate Hermite subdivision
A subdivision scheme for constructing smooth surfaces interpolating scattered data in is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points from which none of the pairs and with coincide, it is proved that the resulting surface (function) is . The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is if the data are not 'too irregular'. Finally the approximation properties of the methods are investigated
Subdivision surface fitting to a dense mesh using ridges and umbilics
Fitting a sparse surface to approximate vast dense data is of interest for many applications: reverse engineering, recognition and compression, etc. The present work provides an approach to fit a Loop subdivision surface to a dense triangular mesh of arbitrary topology, whilst preserving and aligning the original features. The natural ridge-joined connectivity of umbilics and ridge-crossings is used as the connectivity of the control mesh for subdivision, so that the edges follow salient features on the surface. Furthermore, the chosen features and connectivity characterise the overall shape of the original mesh, since ridges capture extreme principal curvatures and ridges start and end at umbilics. A metric of Hausdorff distance including curvature vectors is proposed and implemented in a distance transform algorithm to construct the connectivity. Ridge-colour matching is introduced as a criterion for edge flipping to improve feature alignment. Several examples are provided to demonstrate the feature-preserving capability of the proposed approach
Ellipse-preserving Hermite interpolation and subdivision
We introduce a family of piecewise-exponential functions that have the
Hermite interpolation property. Our design is motivated by the search for an
effective scheme for the joint interpolation of points and associated tangents
on a curve with the ability to perfectly reproduce ellipses. We prove that the
proposed Hermite functions form a Riesz basis and that they reproduce
prescribed exponential polynomials. We present a method based on Green's
functions to unravel their multi-resolution and approximation-theoretic
properties. Finally, we derive the corresponding vector and scalar subdivision
schemes, which lend themselves to a fast implementation. The proposed vector
scheme is interpolatory and level-dependent, but its asymptotic behaviour is
the same as the classical cubic Hermite spline algorithm. The same convergence
properties---i.e., fourth order of approximation---are hence ensured
Point-Normal Subdivision Curves and Surfaces
This paper proposes to generalize linear subdivision schemes to nonlinear
subdivision schemes for curve and surface modeling by refining vertex positions
together with refinement of unit control normals at the vertices. For each
round of subdivision, new control normals are obtained by projections of
linearly subdivided normals onto unit circle or sphere while new vertex
positions are obtained by updating linearly subdivided vertices along the
directions of the newly subdivided normals. Particularly, the new position of
each linearly subdivided vertex is computed by weighted averages of end points
of circular or helical arcs that interpolate the positions and normals at the
old vertices at one ends and the newly subdivided normal at the other ends.
The main features of the proposed subdivision schemes are three folds:
(1) The point-normal (PN) subdivision schemes can reproduce circles, circular
cylinders and spheres using control points and control normals;
(2) PN subdivision schemes generalized from convergent linear subdivision
schemes converge and can have the same smoothness orders as the linear schemes;
(3) PN subdivision schemes generalizing linear subdivision schemes that
generate subdivision surfaces with flat extraordinary points can generate
visually subdivision surfaces with non-flat extraordinary points.
Experimental examples have been given to show the effectiveness of the
proposed techniques for curve and surface modeling.Comment: 30 pages, 17 figures, 22.5M
Eulerian digraphs and toric Calabi-Yau varieties
We investigate the structure of a simple class of affine toric Calabi-Yau
varieties that are defined from quiver representations based on finite eulerian
directed graphs (digraphs). The vanishing first Chern class of these varieties
just follows from the characterisation of eulerian digraphs as being connected
with all vertices balanced. Some structure theory is used to show how any
eulerian digraph can be generated by iterating combinations of just a few
canonical graph-theoretic moves. We describe the effect of each of these moves
on the lattice polytopes which encode the toric Calabi-Yau varieties and
illustrate the construction in several examples. We comment on physical
applications of the construction in the context of moduli spaces for
superconformal gauged linear sigma models.Comment: 27 pages, 8 figure
Automorphisms of generalized Thompson groups
We look at the automorphisms of Thompson type groups of piecewise linear
homeomorphisms of the real line or circle that use slopes that are integral
powers of a fixed integer n with n>2. We show that large numbers of "exotic"
automorphisms appear---automorphisms that are represented as conjugation by
non-PL homeomorphisms of the real line or circle. This is in contrast to the
n=2 case where no such automorphisms appear.Comment: DVI and Post-Script files onl
- …