Weaving patterns inspired by the pentagon snub subdivision scheme

Various computer simulations regarding, e.g., the weather or structural mechanics, solve complex problems on a two-dimensional domain. They mostly do so by splitting the input domain into a finite set of smaller and simpler elements on which the simulation can be run fast and efficiently. This process of splitting can be automatized by using subdivision schemes. Given the wide range of simulation problems to be tackled, an equally wide range of subdivision schemes is available. They create subdivisions that are (mainly) comprised of triangles, quadrilaterals, or hexagons. Furthermore, they ensure that (almost) all vertices have the same number of neighboring vertices. This paper illustrates a subdivision scheme that splits the input domain into pentagons. Repeated application of the scheme gives rise to fractal-like structures. Furthermore, the resulting subdivided domain admits to certain weaving patterns. These patterns are subsequently generalized to several other subdivision schemes. As a final contribution, we provide paper models illustrating the weaving patterns induced by the pentagonal subdivision scheme. Furthermore, we present a jigsaw puzzle illustrating both the subdivision process and the induced weaving pattern. These transform the visual and abstract mathematical algorithms into tactile objects that offer exploration possibilities aside from the visual.Comment: Submitted for publication to the Journal of Mathematics and the Arts (2022

Composite primal/dual √3-subdivision schemes

We present new families of primal and dual subdivision schemes for triangle meshes and 3-refinement. The proposed schemes use two simple local rules which cycle between primal and dual meshes a number of times. The resulting surfaces become very smooth at regular vertices if the number of cycles is ⩾2. The C^1-property is violated only at low-valence irregular vertices, and can be restored by slight modifications of the local rules used. As a generalization, we introduce a wide class of composite subdivision schemes suitable for arbitrary topologies and refinement rules. A composite scheme is defined by a simple upsampling from the coarse to a refined topology, embedded into a cascade of geometric averaging operators acting on coarse and/or refined topologies. We propose a small set of such averaging rules (and some of their parametric extensions) which allow for the switching between control nets associated with the same or different topologic elements (vertices, edges, faces), and show a number of examples, based on triangles, that the resulting class of composite subdivision schemes contains new and old, primal and dual schemes for 3-refinement as well as for quadrisection. As a common observation from the examples considered, we found that irregular vertex treatment is necessary only at vertices of low valence, and can easily be implemented by using generic modifications of some elementary averaging rules

New strategies for curve and arbitrary-topology surface constructions for design

This dissertation presents some novel constructions for curves and surfaces with arbitrary topology in the context of geometric modeling. In particular, it deals mainly with three intimately connected topics that are of interest in both theoretical and applied research: subdivision surfaces, non-uniform local interpolation (in both univariate and bivariate cases), and spaces of generalized splines. Specifically, we describe a strategy for the integration of subdivision surfaces in computer-aided design systems and provide examples to show the effectiveness of its implementation. Moreover, we present a construction of locally supported, non-uniform, piecewise polynomial univariate interpolants of minimum degree with respect to other prescribed design parameters (such as support width, order of continuity and order of approximation). Still in the setting of non-uniform local interpolation, but in the case of surfaces, we devise a novel parameterization strategy that, together with a suitable patching technique, allows us to define composite surfaces that interpolate given arbitrary-topology meshes or curve networks and satisfy both requirements of regularity and aesthetic shape quality usually needed in the CAD modeling framework. Finally, in the context of generalized splines, we propose an approach for the construction of the optimal normalized totally positive (B-spline) basis, acknowledged as the best basis of representation for design purposes, as well as a numerical procedure for checking the existence of such a basis in a given generalized spline space. All the constructions presented here have been devised keeping in mind also the importance of application and implementation, and of the related requirements that numerical procedures must satisfy, in particular in the CAD context

Analysis and new constructions of generalized barycentric coordinates in 2D

Different coordinate systems allow to uniquely determine the position of a geometric element in space. In this dissertation, we consider a coordinate system that lets us determine the position of a two-dimensional point in the plane with respect to an arbitrary simple polygon. Coordinates of this system are called generalized barycentric coordinates in 2D and are widely used in computer graphics and computational mechanics. There exist many coordinate functions that satisfy all the basic properties of barycentric coordinates, but they differ by a number of other properties. We start by providing an extensive comparison of all existing coordinate functions and pointing out which important properties of generalized barycentric coordinates are not satisfied by these functions. This comparison shows that not all of existing coordinates have fully investigated properties, and we complete such a theoretical analysis for a particular one-parameter family of generalized barycentric coordinates for strictly convex polygons. We also perform numerical analysis of this family and show how to avoid computational instabilities near the polygon’s boundary when computing these coordinates in practice. We conclude this analysis by implementing some members of this family in the Computational Geometry Algorithm Library. In the second half of this dissertation, we present a few novel constructions of non-negative and smooth generalized barycentric coordinates defined over any simple polygon. In this context, we show that new coordinates with improved properties can be obtained by taking convex combinations of already existing coordinate functions and we give two examples of how to use such convex combinations for polygons without and with interior points. These new constructions have many attractive properties and perform better than other coordinates in interpolation and image deformation applications

Arbitrary topology meshes in geometric design and vector graphics

Meshes are a powerful means to represent objects and shapes both in 2D and 3D, but the techniques based on meshes can only be used in certain regular settings and restrict their usage. Meshes with an arbitrary topology have many interesting applications in geometric design and (vector) graphics, and can give designers more freedom in designing complex objects. In the first part of the thesis we look at how these meshes can be used in computer aided design to represent objects that consist of multiple regular meshes that are constructed together. Then we extend the B-spline surface technique from the regular setting to work on extraordinary regions in meshes so that multisided B-spline patches are created. In addition, we show how to render multisided objects efficiently, through using the GPU and tessellation. In the second part of the thesis we look at how the gradient mesh vector graphics primitives can be combined with procedural noise functions to create expressive but sparsely defined vector graphic images. We also look at how the gradient mesh can be extended to arbitrary topology variants. Here, we compare existing work with two new formulations of a polygonal gradient mesh. Finally we show how we can turn any image into a vector graphics image in an efficient manner. This vectorisation process automatically extracts important image features and constructs a mesh around it. This automatic pipeline is very efficient and even facilitates interactive image vectorisation

Non-linear subdivision of univariate signals and discrete surfaces

During the last 20 years, the joint expansion of computing power, computer graphics, networking capabilities and multiresolution analysis have stimulated several research domains, and developed the need for new types of data such as 3D models, i.e. discrete surfaces. In the intersection between multiresolution analysis and computer graphics, subdivision methods, i.e. iterative refinement procedures of curves or surfaces, have a non-negligible place, since they are a basic component needed to adapt existing multiresolution techniques dedicated to signals and images to more complicated data such as discrete surfaces represented by polygonal meshes. Such representations are of great interest since they make polygonal meshes nearly as exible as higher level 3D model representations, such as piecewise polynomial based surfaces (e.g. NURBS, B-splines...). The generalization of subdivision methods from univariate data to polygonal meshes is relatively simple in case of a regular mesh but becomes less straightforward when handling irregularities. Moreover, in the linear univariate case, obtaining a smoother limit curve is achieved by increasing the size of the support of the subdivision scheme, which is not a trivial operation in the case of a surface subdivision scheme without a priori assumptions on the mesh. While many linear subdivision methods are available, the studies concerning more general non-linear methods are relatively sparse, whereas such techniques could be used to achieve better results without increasing the size support. The goal of this study is to propose and to analyze a binary non-linear interpolatory subdivision method. The proposed technique uses local polar coordinates to compute the positions of the newly inserted points. It is shown that the method converges toward continuous limit functions. The proposed univariate scheme is extended to triangular meshes, possibly with boundaries. In order to evaluate characteristics of the proposed scheme which are not proved analytically, numerical estimates to study convergence, regularity of the limit function and approximation order are studied and validated using known linear schemes of identical support. The convergence criterion is adapted to surface subdivision via a Hausdorff distance-based metric. The evolution of Gaussian and mean curvature of limit surfaces is also studied and compared against theoretical values when available. An application of surface subdivision to build a multiresolution representation of 3D models is also studied. In particular, the efficiency of such a representation for compression and in terms of rate-distortion of such a representation is shown. An alternate to the initial SPIHT-based encoding, based on the JPEG 2000 image compression standard method. This method makes possible partial decoding of the compressed model in both SNR-progressive and level-progressive ways, while adding only a minimal overhead when compared to SPIHT

A Parallel Solution Adaptive Implementation of the Direct Simulation Monte Carlo Method

This thesis deals with the direct simulation Monte Carlo (DSMC) method of analysing gas flows. The DSMC method was initially proposed as a method for predicting rarefied flows where the Navier-Stokes equations are inaccurate. It has now been extended to near continuum flows. The method models gas flows using simulation molecules which represent a large number of real molecules in a probabilistic simulation to solve the Boltzmann equation. Molecules are moved through a simulation of physical space in a realistic manner that is directly coupled to physical time such that unsteady flow characteristics are modelled. Intermolecular collisions and moleculesurface collisions are calculated using probabilistic, phenomenological models. The fundamental assumption of the DSMC method is that the molecular movement and collision phases can be decoupled over time periods that are smaller than the mean collision time. Two obstacles to the wide spread use of the DSMC method as an engineering tool are in the areas of simulation configuration, which is the configuration of the simulation parameters to provide a valid solution, and the time required to obtain a solution. For complex problems, the simulation will need to be run multiple times, with the simulation configuration being modified between runs to provide an accurate solution for the previous run's results, until the solution converges. This task is time consuming and requires the user to have a good understanding of the DSMC method. Furthermore, the computational resources required by a DSMC simulation increase rapidly as the simulation approaches the continuum regime. Similarly, the computational requirements of three-dimensional problems are generally two orders of magnitude more than two-dimensional problems. These large computational requirements significantly limit the range of problems that can be practically solved on an engineering workstation or desktop computer. The first major contribution of this thesis is in the development of a DSMC implementation that automatically adapts the simulation. Rather than modifying the simulation configuration between solution runs, this thesis presents the formulation of algorithms that allow the simulation configuration to be automatically adapted during a single run. These adaption algorithms adjust the three main parameters that effect the accuracy of a DSMC simulation, namely the solution grid, the time step and the simulation molecule number density. The second major contribution extends the parallelisation of the DSMC method. The implementation developed in this thesis combines the capability to use a cluster of computers to increase the maximum size of problem that can be solved while simultaneously allowing excess computational resources to decrease the total solution time. Results are presented to verify the accuracy of the underlying DSMC implementation, the utility of the solution adaption algorithms and the efficiency of the parallelisation implementation

Refficientlib: an efficient load-rebalanced adaptive mesh refinement algorithm for high-performance computational physics meshes

No separate or additional fees are collected for access to or distribution of the work.In this paper we present a novel algorithm for adaptive mesh refinement in computational physics meshes in a distributed memory parallel setting. The proposed method is developed for nodally based parallel domain partitions where the nodes of the mesh belong to a single processor, whereas the elements can belong to multiple processors. Some of the main features of the algorithm presented in this paper are its capability of handling multiple types of elements in two and three dimensions (triangular, quadrilateral, tetrahedral, and hexahedral), the small amount of memory required per processor, and the parallel scalability up to thousands of processors. The presented algorithm is also capable of dealing with nonbalanced hierarchical refinement, where multirefinement level jumps are possible between neighbor elements. An algorithm for dealing with load rebalancing is also presented, which allows us to move the hierarchical data structure between processors so that load unbalancing is kept below an acceptable level at all times during the simulation. A particular feature of the proposed algorithm is that arbitrary renumbering algorithms can be used in the load rebalancing step, including both graph partitioning and space-filling renumbering algorithms. The presented algorithm is packed in the Fortran 2003 object oriented library \textttRefficientLib, whose interface calls which allow it to be used from any computational physics code are summarized. Finally, numerical experiments illustrating the performance and scalability of the algorithm are presented.Peer ReviewedPostprint (published version