3,028 research outputs found
Recommended from our members
An interpolatory subdivision algorithm for surfaces over arbitrary triangulations
In this paper, an interpolatory subdivision algorithm for surfaces over ar-bitrary triangulations is introduced and its convergence properties over nonuni-form triangulations studied. The so called Butterfly Scheme (interpolatory) is a special case of this algorithm. In our analysis of the algorithm over uniform triangulations, a matrix approach is employed and the idea, of "Cross Differ-ence of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. While for nonuniform data, an extraordi-nary point analysis is introduced and the local subdivision matrix analysis is presented. It is proved that the algorithm produces smooth surfaces over ar-bitrary triangular networks provided the shape parameters are kept within an appropriate range
Recommended from our members
A 10-point interpolatory recursive subdivision algorithm for the generation of parametric surfaces
In this paper, an interpolatory subdivision algorithm for surfaces over arbitrary triangulations is introduced and its properties over uniform triangulations studied. The Butterfly Scheme, which is introduced by Dyn, Gregory and Levin is a special case of this algorithm. In our analysis, the matrix approach is employed and the idea of "Cross Difference of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. It is proved that the algorithm produces smooth surfaces provided the shape parameters are kept within an appropriate range
Computing trisections of 4-manifolds
Algorithms that decompose a manifold into simple pieces reveal the geometric
and topological structure of the manifold, showing how complicated structures
are constructed from simple building blocks. This note describes a way to
algorithmically construct a trisection, which describes a -dimensional
manifold as a union of three -dimensional handlebodies. The complexity of
the -manifold is captured in a collection of curves on a surface, which
guide the gluing of the handelbodies. The algorithm begins with a description
of a manifold as a union of pentachora, or -dimensional simplices. It
transforms this description into a trisection. This results in the first
explicit complexity bounds for the trisection genus of a -manifold in terms
of the number of pentachora (-simplices) in a triangulation.Comment: 15 pages, 9 figure
Goldberg, Fuller, Caspar, Klug and Coxeter and a general approach to local symmetry-preserving operations
Cubic polyhedra with icosahedral symmetry where all faces are pentagons or
hexagons have been studied in chemistry and biology as well as mathematics. In
chemistry one of these is buckminsterfullerene, a pure carbon cage with maximal
symmetry, whereas in biology they describe the structure of spherical viruses.
Parameterized operations to construct all such polyhedra were first described
by Goldberg in 1937 in a mathematical context and later by Caspar and Klug --
not knowing about Goldberg's work -- in 1962 in a biological context. In the
meantime Buckminster Fuller also used subdivided icosahedral structures for the
construction of his geodesic domes. In 1971 Coxeter published a survey article
that refers to these constructions. Subsequently, the literature often refers
to the Goldberg-Coxeter construction. This construction is actually that of
Caspar and Klug. Moreover, there are essential differences between this
(Caspar/Klug/Coxeter) approach and the approaches of Fuller and of Goldberg. We
will sketch the different approaches and generalize Goldberg's approach to a
systematic one encompassing all local symmetry-preserving operations on
polyhedra
Optimal Order Convergence Implies Numerical Smoothness
It is natural to expect the following loosely stated approximation principle
to hold: a numerical approximation solution should be in some sense as smooth
as its target exact solution in order to have optimal convergence. For
piecewise polynomials, that means we have to at least maintain numerical
smoothness in the interiors as well as across the interfaces of cells or
elements. In this paper we give clear definitions of numerical smoothness that
address the across-interface smoothness in terms of scaled jumps in derivatives
[9] and the interior numerical smoothness in terms of differences in derivative
values. Furthermore, we prove rigorously that the principle can be simply
stated as numerical smoothness is necessary for optimal order convergence. It
is valid on quasi-uniform meshes by triangles and quadrilaterals in two
dimensions and by tetrahedrons and hexahedrons in three dimensions. With this
validation we can justify, among other things, incorporation of this principle
in creating adaptive numerical approximation for the solution of PDEs or ODEs,
especially in designing proper smoothness indicators or detecting potential
non-convergence and instability
Identifying and remeshing contact interfaces in a polyhedral assembly for digital mock-up applications
Polyhedral models are widely used for applications such as manufacturing, digital simulation or visualization. They are discrete models; easy to store, to manipulate, allowing levels of resolution for visualization. They can be easily exchanged between CAD systems without loss of data. Previous works (Comput Aided Des 29(4):287–298, 1997, Comput Graphics 22(5):565–585, 1998) have focused on simplification process applied to polyhedral part models. The goal of the proposed approach is to extend these processes to polyhedral assembly models, describing the digital mock-up of a future manufacturing product. To apply simplification techniques or other processes on polyhedral assemblies, contact surfaces between interacting objects have to be identified and specific constraints must be applied for processing. The approach proposed allows checking and maintaining a global consistency of the assembly model to ensure the reliability of the future processes. Thus, contacts between objects are detected using an approach that works for a static configuration of the assembly. Finally, a precise detection of the faces involved in each contact area is made and the resulting input domains identified are processed using a local Frontal Delaunay re-meshing technique to produce an identical tessellation on both objects involved in the processed contact. The quality of the triangulation produced is also checked
Tropical surface singularities
In this paper, we study tropicalisations of singular surfaces in toric
threefolds. We completely classify singular tropical surfaces of
maximal-dimensional type, show that they can generically have only finitely
many singular points, and describe all possible locations of singular points.
More precisely, we show that singular points must be either vertices, or
generalized midpoints and baricenters of certain faces of singular tropical
surfaces, and, in some cases, there may be additional metric restrictions to
faces of singular tropical surfaces.Comment: A gap in the classification was closed. 37 pages, 29 figure
- …