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

Hybrid modelling of heterogeneous volumetric objects.

Heterogeneous multi-material volumetric modelling is an emerging and rapidly developing field. A Heterogeneous object is a volumetric object with interior structure where different physically-based attributes are defined. The attributes can be of different nature: material distributions, density, microstructures, optical properties and others. Heterogeneous objects are widely used where the presence of the interior structures is an important part of the model. Computer-aided design (CAD), additive manufacturing, physical simulations, visual effects, medical visualisation and computer art are examples of such applications. In particular, digital fabrication employing multi-material 3D printing techniques is becoming omnipresent. However, the specific methods and tools for representation, modelling, rendering, animation and fabrication of multi-material volumetric objects with attributes are only starting to emerge. The need for adequate unifying theoretical and practical framework has been obvious. Developing adequate representational schemes for heterogeneous objects is in the core of research in this area. The most widely used representations for defining heterogeneous objects are boundary representation, distance-based representations, function representation and voxels. These representations work well for modelling homogeneous (solid) objects but they all have significant drawbacks when dealing with heterogeneous objects. In particular, boundary representation, while maintaining its prevailing role in computer graphics and geometric modelling, is not inherently natural for dealing with heterogeneous objects especially in the con- text of additive manufacturing and 3D printing, where multi-material properties are paramount as well as in physical simulation where the exact representation rather than an approximate one can be important. In this thesis, we introduce and systematically describe a theoretical and practical framework for modelling volumetric heterogeneous objects on the basis of a novel unifying functionally-based hybrid representation called HFRep. It is based on the function representation (FRep) and several distance-based representations, namely signed distance fields (SDFs), adaptively sampled distance fields (ADFs) and interior distance fields (IDFs). It embraces advantages and circumvents disadvantages of the initial representations. A mathematically substantiated theoretical description of the HFRep with an emphasis on defining functions for HFRep objects’ geometry and attributes is provided. This mathematical framework serves as the basis for developing efficient algorithms for the generation of HFRep objects taking into account both their geometry and attributes. To make the proposed approach practical, a detailed description of efficient algorithmic procedures has been developed. This has required employing a number of novel techniques of different nature, separately and in combination. In particular, an extension of a fast iterative method (FIM) for numerical solving of the eikonal equation on hierarchical grids was developed. This allowed for efficient computation of smooth distance-based attributes. To prove the concept, the main elements of the framework have been implemented and used in several applications of different nature. It was experimentally shown that the developed methods and tools can be used for generating objects with complex interior structure, e.g. microstructures, and different attributes. A special consideration has been devoted to applications of dynamic nature. A novel concept of heterogeneous space-time blending (HSTB) method with an automatic control for metamorphosis of heterogeneous objects with textures, both in 2D and 3D, has been introduced, algorithmised and implemented. We have applied the HSTB in the context of ‘4D Cubism’ project. There are plans to use the developed methods and tools for many other applications

Numerical Methods in Shape Spaces and Optimal Branching Patterns

The contribution of this thesis is twofold. The main part deals with numerical methods in the context of shape space analysis, where the shape space at hand is considered as a Riemannian manifold. In detail, we apply and extend the time-discrete geodesic calculus (established by Rumpf and Wirth [WBRS11, RW15]) to the space of discrete shells, i.e. triangular meshes with fixed connectivity. The essential building block is a variational time-discretization of geodesic curves, which is based on a local approximation of the squared Riemannian distance on the manifold. On physical shape spaces this approximation can be derived e.g. from a dissimilarity measure. The dissimilarity measure between two shell surfaces can naturally be defined as an elastic deformation energy capturing both membrane and bending distortions. Combined with a non-conforming discretization of a physically sound thin shell model the time-discrete geodesic calculus applied to the space of discrete shells is shown to be suitable to solve important problems in computer graphics and animation. To extend the existing calculus, we introduce a generalized spline functional based on the covariant derivative along a curve in shape space whose minimizers can be considered as Riemannian splines. We establish a corresponding time-discrete functional that fits perfectly into the framework of Rumpf and Wirth, and prove this discretization to be consistent. Several numerical simulations reveal that the optimization of the spline functional—subject to appropriate constraints—can be used to solve the multiple interpolation problem in shape space, e.g. to realize keyframe animation. Based on the spline functional, we further develop a simple regression model which generalizes linear regression to nonlinear shape spaces. Numerical examples based on real data from anatomy and botany show the capability of the model. Finally, we apply the statistical analysis of elastic shape spaces presented by Rumpf and Wirth [RW09, RW11] to the space of discrete shells. To this end, we compute a Fréchet mean within a class of shapes bearing highly nonlinear variations and perform a principal component analysis with respect to the metric induced by the Hessian of an elastic shell energy. The last part of this thesis deals with the optimization of microstructures arising e.g. at austenite-martensite interfaces in shape memory alloys. For a corresponding scalar problem, Kohn and Müller [KM92, KM94] proved existence of a minimizer and provided a lower and an upper bound for the optimal energy. To establish the upper bound, they studied a particular branching pattern generated by mixing two different martensite phases. We perform a finite element simulation based on subdivision surfaces that suggests a topologically different class of branching patterns to represent an optimal microstructure. Based on these observations we derive a novel, low dimensional family of patterns and show—numerically and analytically—that our new branching pattern results in a significantly better upper energy bound

Automatic Main Road Extraction from High Resolution Satellite Imagery

Road information is essential for automatic GIS (geographical information system) data acquisition, transportation and urban planning. Automatic road (network) detection from high resolution satellite imagery will hold great potential for significant reduction of database development/updating cost and turnaround time. From so called low level feature detection to high level context supported grouping, so many algorithms and methodologies have been presented for this purpose. There is not any practical system that can fully automatically extract road network from space imagery for the purpose of automatic mapping. This paper presents the methodology of automatic main road detection from high resolution satellite IKONOS imagery. The strategies include multiresolution or image pyramid method, Gaussian blurring and the line finder using 1-dimemsional template correlation filter, line segment grouping and multi-layer result integration. Multi-layer or multi-resolution method for road extraction is a very effective strategy to save processing time and improve robustness. To realize the strategy, the original IKONOS image is compressed into different corresponding image resolution so that an image pyramid is generated; after that the line finder of 1-dimemsional template correlation filter after Gaussian blurring filtering is applied to detect the road centerline. Extracted centerline segments belong to or do not belong to roads. There are two ways to identify the attributes of the segments, the one is using segment grouping to form longer line segments and assign a possibility to the segment depending on the length and other geometric and photometric attribute of the segment, for example the longer segment means bigger possibility of being road. Perceptual-grouping based method is used for road segment linking by a possibility model that takes multi-information into account; here the clues existing in the gaps are considered. Another way to identify the segments is feature detection back-to-higher resolution layer from the image pyramid

Advanced Numerical Modelling of Discontinuities in Coupled Boundary ValueProblems

Industrial development processes as well as research in physics, materials and engineering science rely on computer modelling and simulation techniques today. With increasing computer power, computations are carried out on multiple scales and involve the analysis of coupled problems. In this work, continuum modelling is therefore applied at different scales in order to facilitate a prediction of the effective material or structural behaviour based on the local morphology and the properties of the individual constituents. This provides valueable insight into the structure-property relations which are of interest for any design process. In order to obtain reasonable predictions for the effective behaviour, numerical models which capture the essential fine scale features are required. In this context, the efficient representation of discontinuities as they arise at, e.g. material interfaces or cracks, becomes more important than in purely phenomenological macroscopic approaches. In this work, two different approaches to the modelling of discontinuities are discussed: (i) a sharp interface representation which requires the localisation of interfaces by the mesh topology. Since many interesting macroscopic phenomena are related to the temporal evolution of certain microscopic features, (ii) diffuse interface models which regularise the interface in terms of an additional field variable and therefore avoid topological mesh updates are considered as an alternative. With the two combinations (i) Extended Finite Elemente Method (XFEM) + sharp interface model, and (ii) Isogeometric Analysis (IGA) + diffuse interface model, two fundamentally different approaches to the modelling of discontinuities are investigated in this work. XFEM reduces the continuity of the approximation by introducing suitable enrichment functions according to the discontinuity to be modelled. Instead, diffuse models regularise the interface which in many cases requires even an increased continuity that is provided by the spline-based approximation. To further increase the efficiency of isogeometric discretisations of diffuse interfaces, adaptive mesh refinement and coarsening techniques based on hierarchical splines are presented. The adaptive meshes are found to reduce the number of degrees of freedom required for a certain accuracy of the approximation significantly. Selected discretisation techniques are applied to solve a coupled magneto-mechanical problem for particulate microstructures of Magnetorheological Elastomers (MRE). In combination with a computational homogenisation approach, these microscopic models allow for the prediction of the effective coupled magneto-mechanical response of MRE. Moreover, finite element models of generic MRE microstructures are coupled with a BEM domain that represents the surrounding free space in order to take into account finite sample geometries. The macroscopic behaviour is analysed in terms of actuation stresses, magnetostrictive deformations, and magnetorheological effects. The results obtained for different microstructures and various loadings have been found to be in qualitative agreement with experiments on MRE as well as analytical results.Industrielle Entwicklungsprozesse und die Forschung in Physik, Material- und Ingenieurwissenschaft greifen in einem immer stärkeren Umfang auf rechnergestützte Modellierungs- und Simulationsverfahren zurück. Die ständig steigende Rechenleistung ermöglicht dabei auch die Analyse mehrskaliger und gekoppelter Probleme. In dieser Arbeit kommt daher ein kontinuumsmechanischer Modellierungsansatz auf verschiedenen Skalen zum Einsatz. Das Ziel der Berechnungen ist dabei die Vorhersage des effektiven Material- bzw. Strukturverhaltens auf der Grundlage der lokalen Werkstoffstruktur und der Eigenschafen der konstitutiven Bestandteile. Derartige Simulationen liefern interessante Aussagen zu den Struktur-Eigenschaftsbeziehungen, deren Verständnis entscheidend für das Material- und Strukturdesign ist. Um aussagekräftige Vorhersagen des effektiven Verhaltens zu erhalten, sind numerische Modelle erforderlich, die wesentliche Eigenschaften der lokalen Materialstruktur abbilden. Dabei kommt der effizienten Modellierung von Diskontinuitäten, beispielsweise Materialgrenzen oder Rissen, eine deutlich größere Bedeutung zu als bei einer makroskopischen Betrachtung. In der vorliegenden Arbeit werden zwei unterschiedliche Modellierungsansätze für Unstetigkeiten diskutiert: (i) eine scharfe Abbildung, die üblicherweise konforme Berechnungsnetze erfordert. Da eine Evolution der Mikrostruktur bei einer derartigen Modellierung eine Topologieänderung bzw. eine aufwendige Neuvernetzung nach sich zieht, werden alternativ (ii) diffuse Modelle, die eine zusätzliche Feldvariable zur Regularisierung der Grenzfläche verwenden, betrachtet. Mit der Kombination von (i) Erweiterter Finite-Elemente-Methode (XFEM) + scharfem Grenzflächenmodell sowie (ii) Isogeometrischer Analyse (IGA) + diffuser Grenzflächenmodellierung werden in der vorliegenden Arbeit zwei fundamental verschiedene Zugänge zur Modellierung von Unstetigkeiten betrachtet. Bei der Diskretisierung mit XFEM wird die Kontinuität der Approximation durch eine Anreicherung der Ansatzfunktionen gemäß der abzubildenden Unstetigkeit reduziert. Demgegenüber erfolgt bei einer diffusen Grenzflächenmodellierung eine Regularisierung. Die dazu erforderliche zusätzliche Feldvariable führt oft zu Feldgleichungen mit partiellen Ableitungen höherer Ordnung und weist in ihrem Verlauf starke Gradienten auf. Die daraus resultierenden Anforderungen an den Ansatz werden durch eine Spline-basierte Approximation erfüllt. Um die Effizienz dieser isogeometrischen Diskretisierung weiter zu erhöhen, werden auf der Grundlage hierarchischer Splines adaptive Verfeinerungs- und Vergröberungstechniken entwickelt. Ausgewählte Diskretisierungsverfahren werden zur mehrskaligen Modellierung des gekoppelten magnetomechanischen Verhaltens von Magnetorheologischen Elastomeren (MRE) angewendet. In Kombination mit numerischen Homogenisierungsverfahren, ermöglichen die Mikrostrukturmodelle eine Vorhersage des effektiven magnetomechanischen Verhaltens von MRE. Außerderm wurden Verfahren zur Kopplung von FE-Modellen der MRE-Mikrostruktur mit einem Randelement-Modell der Umgebung vorgestellt. Mit Hilfe der entwickelten Verfahren kann das Verhalten von MRE in Form von Aktuatorspannungen, magnetostriktiven Deformationen und magnetischen Steifigkeitsänderungen vorhergesagt werden. Im Gegensatz zu zahlreichen anderen Modellierungsansätzen, stimmen die mit den hier vorgestellten Methoden für unterschiedliche Mikrostrukturen erzielten Vorhersagen sowohl mit analytischen als auch experimentellen Ergebnissen überein

A Parametrization-Based Surface Reconstruction System for Triangular Mesh Simplification with Application to Large Scale Scenes

The laser scanner is nowadays widely used to capture the geometry of art, animation maquettes, or large architectural, industrial, and land form models. It thus poses specific problems depending on the model scale. This thesis provides a solution for simplification of triangulated data and for surface reconstruction of large data sets, where feature edges provide an obvious segmentation structure. It also explores a new method for model segmentation, with the goal of applying multiresolution techniques to data sets characterized by curvy areas and the lack of clear demarcation features. The preliminary stage of surface segmentation, which takes as input single or multiple scan data files, generates surface patches which are processed independently. The surface components are mapped onto a two-dimensional domain with boundary constraints, using a novel parametrization weight coefficient. This stage generates valid parameter domain points, which can be fed as arguments to parametric modeling functions or surface approximation schemes. On this domain, our approach explores two types of remeshing. First, we generate points in a regular grid pattern, achieving multiresolution through a flexible grid step, which nevertheless is designed to produce a globally uniform resampling aspect. In this case, for reconstruction, we attempt to solve the open problem of border reconciliation across adjacent domains by retriangulating the border gap between the grid and the fixed irregular border. Alternatively, we straighten the domain borders in the parameter domain and coarsely triangulate the resulting simplified polygons, resampling the base domain triangles in a 1-4 subdivision pattern, achieving multiresolution from the number of subdivision steps. For mesh reconstruction, we use a linear interpolation method based on the original mesh triangles as control points on local planes, using a saved triangle correspondence between the original mesh and the parametric domain. We also use a region-wide approximation method, applied to the parameter grid points, which first generates data-trained control points, and then uses them to obtain the reconstruction values at the resamples. In the grid resampling scheme, due to the border constraints, the reassembly of the segmented, sequentially processed data sets is seamless. In the subdivision scheme, we align adjacent border fragments in the parameter space, and use a region-to-fragment map to achieve the same border reconstruction across two neighboring components. We successfully process data sets up to 1,000,000 points in one pass of our program, and are capable of assembling larger scenes from sequential runs. Our program consists of a single run, without intermediate storage. Where we process large input data files, we fragment the input using a nested application of our segmentation algorithm to reduce the size of the input scenes, and our pipeline reassembles the reconstruction output from multiple data files into a unique view