An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons

In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of particular solutions, high efficiency comes from using solutions to the Helmholtz equation as basis functions. We present and analyze such a method for the scattering of two-dimensional scalar waves from a polygonal domain that achieves exponential convergence purely by increasing the number of basis functions in each element. Key ingredients are the use of basis functions that capture the singularities at corners and the representation of the scattered field towards infinity by a combination of fundamental solutions. The solution is obtained by minimizing a least-squares functional, which we discretize in such a way that a matrix least-squares problem is obtained. We give computable exponential bounds on the rate of convergence of the least-squares functional that are in very good agreement with the observed numerical convergence. Challenging numerical examples, including a nonconvex polygon with several corner singularities, and a cavity domain, are solved to around 10 digits of accuracy with a few seconds of CPU time. The examples are implemented concisely with MPSpack, a MATLAB toolbox for wave computations with nonpolynomial basis functions, developed by the authors. A code example is included

The Method of Fundamental Solutions for Direct Cavity Problems in EIT

The Method of Fundamental Solutions (MFS) is an effective technique for solving linear elliptic partial differential equations, such as the Laplace and Helmholtz equation. It is a form of indirect boundary integral equation method and a technique that uses boundary collocation or boundary fitting. In this paper the MFS is implemented to solve A numerically an inverse problem which consists of finding an unknown cavity within a region of interest based on given boundary Cauchy data. A range of examples are used to demonstrate that the technique is very effective at locating cavities in two-dimensional geometries for exact input data. The technique is then developed to include a regularisation parameter that enables cavities to be located accurately and stably even for noisy input data

Non-rigid registration of 2-D/3-D dynamic data with feature alignment

In this work, we are computing the matching between 2D manifolds and 3D manifolds with temporal constraints, that is we are computing the matching among a time sequence of 2D/3D manifolds. It is solved by mapping all the manifolds to a common domain, then build their matching by composing the forward mapping and the inverse mapping. At first, we solve the matching problem between 2D manifolds with temporal constraints by using mesh-based registration method. We propose a surface parameterization method to compute the mapping between the 2D manifold and the common 2D planar domain. We can compute the matching among the time sequence of deforming geometry data through this common domain. Compared with previous work, our method is independent of the quality of mesh elements and more efficient for the time sequence data. Then we develop a global intensity-based registration method to solve the matching problem between 3D manifolds with temporal constraints. Our method is based on a 4D(3D+T) free-from B-spline deformation model which has both spatial and temporal smoothness. Compared with previous 4D image registration techniques, our method avoids some local minimum. Thus it can be solved faster and achieve better accuracy of landmark point predication. We demonstrate the efficiency of these works on the real applications. The first one is applied to the dynamic face registering and texture mapping. The second one is applied to lung tumor motion tracking in the medical image analysis. In our future work, we are developing more efficient mesh-based 4D registration method. It can be applied to tumor motion estimation and tracking, which can be used to calculate the read dose delivered to the lung and surrounding tissues. Thus this can support the online treatment of lung cancer radiotherapy

Theory and applications of bijective barycentric mappings

Barycentric coordinates provide a convenient way to represent a point inside a triangle as a convex combination of the triangle's vertices, and to linearly interpolate data given at these vertices. Due to their favourable properties, they are commonly applied in geometric modelling, finite element methods, computer graphics, and many other fields. In some of these applications it is desirable to extend the concept of barycentric coordinates from triangles to polygons. Several variants of such generalized barycentric coordinates have been proposed in recent years. An important application of barycentric coordinates consists of barycentric mappings, which allow to naturally warp a source polygon to a corresponding target polygon, or more generally, to create mappings between closed curves or polyhedra. The principal practical application is image warping, which takes as input a control polygon drawn around an image and smoothly warps the image by moving the polygon vertices. A required property of image warping is to avoid fold-overs in the resulting image. The problem of fold-overs is a manifestation of a larger problem related to the lack of bijectivity of the barycentric mapping. Unfortunately, bijectivity of such barycentric mappings can only be guaranteed for the special case of warping between convex polygons or by triangulating the domain and hence renouncing smoothness. In fact, for any barycentric coordinates, it is always possible to construct a pair of polygons such that the barycentric mapping is not bijective. In the first part of this thesis we illustrate three methods to achieve bijective mappings. The first method is based on the intuition that, if two polygons are sufficiently close, then the mapping is close to the identity and hence bijective. This suggests to ``split'' the mapping into several intermediate mappings and to create a composite barycentric mapping which is guaranteed to be bijective between arbitrary polygons, polyhedra, or closed planar curves. We provide theoretical bounds on the bijectivity of the composite mapping related to the norm of the gradient of the coordinates. The fact that the bound depends on the gradient implies that these bounds exist only if the gradient of the coordinates is bounded. We focus on mean value coordinates and analyse the behaviour of their directional derivatives and gradient at the vertices of a polygon. The composition of barycentric mappings for closed planar curves leads to the problem of blending between two planar curves. We suggest to solve it by linearly interpolating the signed curvature and then reconstructing the intermediate curve from the interpolated curvature values. However, when both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the interpolated values. Our method relies on the definition of a suitable metric for measuring the distance between two planar curves and an appropriate discretization of the signed curvature functions. The second method to construct smooth bijective mappings with prescribed behaviour along the domain boundary exploits the properties of harmonic maps. These maps can be approximated in different ways, and we discuss their respective advantages and disadvantages. We further present a simple procedure for reducing their distortion and demonstrate the effectiveness of our approach by providing examples. The last method relies on a reformulation of complex barycentric mappings, which allows us to modify the ``speed'' along the edges to create complex bijective mappings. We provide some initial results and an optimization procedure which creates complex bijective maps. In the second part we provide two main applications of bijective mapping. The first one is in the context of finite elements simulations, where the discretization of the computational domain plays a central role. In the standard discretization, the domain is triangulated with a mesh and its boundary is approximated by a polygon. We present an approach which combines parametric finite elements with smooth bijective mappings, leaving the choice of approximation spaces free. This approach allows to represent arbitrarily complex geometries on coarse meshes with curved edges, regardless of the domain boundary complexity. The main idea is to use a bijective mapping for automatically warping the volume of a simple parametrization domain to the complex computational domain, thus creating a curved mesh of the latter. The second application addresses the meshing problem and the possibility to solve finite element simulations on polygonal meshes. In this context we present several methods to discretize the bijective mapping to create polygonal and piece-wise polynomial meshes

Vapaan reunan ongelma harmonisille funktioille

In this work we consider three different methods for solving a certain kind of free boundary problem for harmonic functions. The considered methods are the boundary element method, the alternating-field technique and the method of fundamental solutions. The main goal of this work is to find out if any of the above methods are eligible for solving the considered free boundary problem. We will also consider if the methods could be applied to solve similar free boundary problems in three dimensions. When testing the performance of the different methods it turns out that the boundary element method does not seem suitable for solving the studied free boundary problem, while rather accurate solutions are obtained using the alternating-field technique and the method of fundamental solutions, out of which the former is found out to be the more reliable one. However, the alternating-field technique is restricted for two dimensional problems whereas the method of fundamental solutions could be relatively easily applied to three dimensional problems as well. Thus, out of the three considered methods the method of fundamental solutions should be the subject of further studies when considering thee dimensional free boundary problems.Tässä työssä tarkastellaan kolmea eri menetelmää tietynlaisen vapaan reunan ongelman ratkaisemiseksi. Tarkasteltavat menetelmät ovat reunaelementtimenetelmä, vuorottaiskenttämenetelmä ja fundamentaaliratkaisujen menetelmä. Työn pääasiallinen tavoite on selvittää, voidaanko työssä tarkasteltavaa vapaan reunan ongelmaa harmonisille funktioille ratkaista käyttäen jotakin edellä mainituista menetelmistä. Lisäksi tarkastellaan, voitaisiinko menetelmiä soveltaa vastaavanlaisten kolmiulotteisten vapaan reunan ongelmien ratkaisemiseen. Menetelmiä testattaessa käy ilmi, että reunaelementtimenetelmä ei vaikuttaisi soveltuvan tarkastellun vapaan reunan ongelman ratkaisemiseen, kun taas vuorottaiskenttämenetelmän ja fundamentaaliratkaisujen menetelmän tuottamat ratkaisut ovat varsin tarkkoja. Kahdesta viimeksi mainitusta menetelmästä vuorottaiskenttämenetelmä todetaan luotettavammaksi. Vuorottaiskenttämenetelmää voidaan kuitenkin käyttää ainoastaan kaksiulotteisten vapaan reunan ongelmien ratkaisemi- seen, kun taas fundamentaaliratkaisujen menetelmä voitaisiin suhteellisen helposti muuntaa kolmiulotteisiin ongelmiin sopivaksi. Täten kaikista kolmesta menetelmästä fundamentaaliratkaisujen menetelmä olisi varteenotettavin vaihtoehto jatkotutkimuksen kohteeksi tarkasteltaessa kolmiulotteisia vapaan reunan ongelmia

Stokes flow analogous to viscous electron current in graphene

Electron transport in two-dimensional conducting materials such as graphene, with dominant electron-electron interaction, exhibits unusual vortex flow that leads to a nonlocal current-field relation (negative resistance), distinct from the classical Ohm's law. The transport behavior of these materials is best described by low Reynolds number hydrodynamics, where the constitutive pressure-speed relation is Stoke's law. Here we report evidence of such vortices observed in a viscous flow of Newtonian fluid in a microfluidic device consisting of a rectangular cavity$-$analogous to the electronic system. We extend our experimental observations to elliptic cavities of different eccentricities, and validate them by numerically solving bi-harmonic equation obtained for the viscous flow with no-slip boundary conditions. We verify the existence of a predicted threshold at which vortices appear. Strikingly, we find that a two-dimensional theoretical model captures the essential features of three-dimensional Stokes flow in experiments.Comment: 6 pages, 6 figure

Heterogeneous volumetric data mapping and its medical applications

With the advance of data acquisition techniques, massive solid geometries are being collected routinely in scientific tasks, these complex and unstructured data need to be effectively correlated for various processing and analysis. Volumetric mapping solves bijective low-distortion correspondence between/among 3D geometric data, and can serve as an important preprocessing step in many tasks in compute-aided design and analysis, industrial manufacturing, medical image analysis, to name a few. This dissertation studied two important volumetric mapping problems: the mapping of heterogeneous volumes (with nonuniform inner structures/layers) and the mapping of sequential dynamic volumes. To effectively handle heterogeneous volumes, first, we studied the feature-aligned harmonic volumetric mapping. Compared to previous harmonic mapping, it supports the point, curve, and iso-surface alignment, which are important low-dimensional structures in heterogeneous volumetric data. Second, we proposed a biharmonic model for volumetric mapping. Unlike the conventional harmonic volumetric mapping that only supports positional continuity on the boundary, this new model allows us to have higher order continuity $C^1$ along the boundary surface. This suggests a potential model to solve the volumetric mapping of complex and big geometries through divide-and-conquer. We also studied the medical applications of our volumetric mapping in lung tumor respiratory motion modeling. We were building an effective digital platform for lung tumor radiotherapy based on effective volumetric CT/MRI image matching and analysis. We developed and integrated in this platform a set of geometric/image processing techniques including advanced image segmentation, finite element meshing, volumetric registration and interpolation. The lung organ/tumor and surrounding tissues are treated as a heterogeneous region and a dynamic 4D registration framework is developed for lung tumor motion modeling and tracking. Compared to the previous 3D pairwise registration, our new 4D parameterization model leads to a significantly improved registration accuracy. The constructed deforming model can hence approximate the deformation of the tissues and tumor

Surface parameterization over regular domains

Surface parameterization has been widely studied and it has been playing a critical role in many geometric processing tasks in graphics, computer-aided design, visualization, vision, physical simulation and etc. Regular domains, such as polycubes, are favored due to their structural regularity and geometric simplicity. This thesis focuses on studying the surface parameterization over regular domains, i.e. polycubes, and develops effective computation algorithms. Firstly, the motivation for surface parameterization and polycube mapping is introduced. Secondly, we briefly review existing surface parameterization techniques, especially for extensively studied parameterization algorithms for topological disk surfaces and parameterizations over regular domains for closed surfaces. Then we propose a polycube parameterization algorithm for closed surfaces with general topology. We develop an efficient optimization framework to minimize the angle and area distortion of the mapping. Its applications on surface meshing, inter-shape morphing and volumetric polycube mapping are also discussed

On the use of rational-function fitting methods for the solution of 2D Laplace boundary-value problems

A computational scheme for solving 2D Laplace boundary-value problems using rational functions as the basis functions is described. The scheme belongs to the class of desingularized methods, for which the location of singularities and testing points is a major issue that is addressed by the proposed scheme, in the context of the 2D Laplace equation. Well-established rational-function fitting techniques are used to set the poles, while residues are determined by enforcing the boundary conditions in the least-squares sense at the nodes of rational Gauss-Chebyshev quadrature rules. Numerical results show that errors approaching the machine epsilon can be obtained for sharp and almost sharp corners, nearly-touching boundaries, and almost-singular boundary data. We show various examples of these cases in which the method yields compact solutions, requiring fewer basis functions than the Nystr\"{o}m method, for the same accuracy. A scheme for solving fairly large-scale problems is also presented