A Family of 6-Point n-Ary Interpolating Subdivision Schemes

We derive three-step algorithm based on divided difference to generate a class of 6-point n-ary interpolating sub-division schemes. In this technique second order divided differences have been calculated at specific position and used to insert new vertices. Interpolating sub-division schemes are more attractive than approximating schemes in computer aided geometric designs because of their interpolation property. Polynomial generation and polynomial reproduction are attractive properties of sub-division schemes. Shape preserving properties are also significant tool in sub-division schemes. Further, some significant properties of ternary and quaternary sub-division schemes have been elaborated such as continuity, degree of polynomial generation, polynomial reproduction and approximation order. Furthermore, shape preserving property that is monotonicity is also derived. Moreover, the visual performance of proposed schemes has also been demonstrated through several examples

A Family of High Continuity Subdivision Schemes Based on Probability Distribution

Subdivision schemes are famous for the generation of smooth curves and surfaces in CAGD (Computer Aided Geometric Design). The continuity is an important property of subdivision schemes. Subdivision schemes having high continuity are always required for geometric modeling. Probability distribution is the branch of statistics which is used to find the probability of an event. We use probability distribution in the field of subdivision schemes. In this paper, a simplest way is introduced to increase the continuity of subdivision schemes. A family of binary approximating subdivision schemes with probability parameter p is constructed by using binomial probability generating function. We have derived some family members and analyzed the important properties such as continuity, Holder regularity, degree of generation, degree of reproduction and limit stencils. It is observed that, when the probability parameter p = 1/2, the family of subdivision schemes have maximum continuity, generation degree and Holder regularity. Comparison shows that our proposed family has high continuity as compare to the existing subdivision schemes. The proposed family also preserves the shape preserving property such as convexity preservation. Subdivision schemes give negatively skewed, normal and positively skewed behavior on convex data due to the probability parameter. Visual performances of the family are also presented

Substitution Delone Sets

This paper addresses the problem of describing aperiodic discrete structures that have a self-similar or self-affine structure. Substitution Delone set families are families of Delone sets (X_1, ..., X_n) in R^d that satisfy an inflation functional equation under the action of an expanding integer matrix in R^d. This paper studies such functional equation in which each X_i is a discrete multiset (a set whose elements are counted with a finite multiplicity). It gives necessary conditions on the coefficients of the functional equation for discrete solutions to exist. It treats the case where the equation has Delone set solutions. Finally, it gives a large set of examples showing limits to the results obtained.Comment: 34 pages, latex file; some results in Sect 5 rearranged and theorems reformulate

A New Strategy for Exact Determination of the Joint Spectral Radius

Computing the joint spectral radius of a finite matrix family is, though interesting for many applications, a difficult problem. This work proposes a method for determining the exact value which is based on graph-theoretical ideas. In contrast to some other algorithms in the literature, the purpose of the approach is not to find an extremal norm for the matrix family. To validate that the finiteness property (FP) is satisfied for a certain matrix product, a tree is to be analyzed whose nodes code sets of matrix products. A sufficient, and in certain situations also necessary, criterion is given by existence of a finite tree with special properties, and an algorithm for searching such a tree is proposed. The suggested method applies in case of several FP-products as well and is not limited to asymptotically simple matrix families. In the smoothness analysis of subdivision schemes, joint spectral radius determination is crucial to detect Hölder regularity. The palindromic symmetry of matrices, which results from symmetric binary subdivision, is considered in the context of set-valued trees. Several illustrating examples explore the capabilities of the approach, consolidated by examples from subdivision

Geometric Structures on Matrix-valued Subdivision Schemes

Surface subdivision schemes are used in computer graphics to generate visually smooth surfaces of arbitrary topology. Applications in computer graphics utilize surface normals and curvature. In this paper, formulas are obtained for the first and second partial derivatives of limit surfaces formed using 1-ring subdivision schemes that have 2 by 2 matrix-valued masks. Consequently, surface normals, and Gaussian and mean curvatures can be derived. Both quadrilateral and triangular schemes are considered and for each scheme both interpolatory and approximating schemes are examined. In each case, we look at both extraordinary and regular vertices. Every 3-D vertex of the refinement polyhedrons also has what is called a corresponding “shape vertex.” The partial derivative formulas consist of linear combinations of surrounding polyhedron vertices as well as their corresponding shape vertices. We are able to derive detailed information on the matrix-valued masks and about the left eigenvectors of the (regular) subdivision matrix. Local parameterizations are done using these left eigenvectors and final formulas for partial derivatives are obtained after we secure detailed information about right eigenvectors of the subdivision matrix. Using specific subdivision schemes, unit normals so obtained are displayed. Also, formulas for initial shape vertices are postulated using discrete unit normals to our original polyhedron. These formulas are tested for reasonableness on surfaces using specific subdivision schemes. Obtaining a specified unit normal at a surface point is examined by changing only these shape vertices. We then describe two applications involving surface normals in the field of computer graphics that can use our results

Wavelet-based multiresolution data representations for scalable distributed GIS services

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002.Includes bibliographical references (p. 155-160).Demand for providing scalable distributed GIS services has been growing greatly as the Internet continues to boom. However, currently available data representations for these services are limited by a deficiency of scalability in data formats. In this research, four types of multiresolution data representations based on wavelet theories have been put forward. The designed Wavelet Image (WImg) data format helps us to achieve dynamic zooming and panning of compressed image maps in a prototype GIS viewer. The Wavelet Digital Elevation Model (WDEM) format is developed to deal with cell-based surface data. A WDEM is better than a raster pyramid in that a WDEM provides a non-redundant multiresolution representation. The Wavelet Arc (WArc) format is developed for decomposing curves into a multiresolution format through the lifting scheme. The Wavelet Triangulated Irregular Network (WTIN) format is developed to process general terrain surfaces based on the second generation wavelet theory. By designing a strategy to resample a terrain surface at subdivision points through the modified Butterfly scheme, we achieve the result: only one wavelet coefficient needs to be stored for each point in the final representation. In contrast to this result, three wavelet coefficients need to be stored for each point in a general 3D object wavelet-based representation. Our scheme is an interpolation scheme and has much better performance than the Hat wavelet filter on a surface. Boundary filters are designed to make the representation consistent with the rectangular boundary constraint.(cont.) We use a multi-linked list and a quadtree array as the data structures for computing. A method to convert a high resolution DEM to a WTIN is also provided. These four wavelet-based representations provide consistent and efficient multiresolution formats for online GIS. This makes scalable distributed GIS services more efficient and implementable.by Jingsong Wu.Ph.D

Internationales Kolloquium über Anwendungen der Informatik und Mathematik in Architektur und Bauwesen : 04. bis 06.07. 2012, Bauhaus-Universität Weimar

The 19th International Conference on the Applications of Computer Science and Mathematics in Architecture and Civil Engineering will be held at the Bauhaus University Weimar from 4th till 6th July 2012. Architects, computer scientists, mathematicians, and engineers from all over the world will meet in Weimar for an interdisciplinary exchange of experiences, to report on their results in research, development and practice and to discuss. The conference covers a broad range of research areas: numerical analysis, function theoretic methods, partial differential equations, continuum mechanics, engineering applications, coupled problems, computer sciences, and related topics. Several plenary lectures in aforementioned areas will take place during the conference. We invite architects, engineers, designers, computer scientists, mathematicians, planners, project managers, and software developers from business, science and research to participate in the conference