An anisotropic mesh adaptation method for the finite element solution of heterogeneous anisotropic diffusion problems

Heterogeneous anisotropic diffusion problems arise in the various areas of science and engineering including plasma physics, petroleum engineering, and image processing. Standard numerical methods can produce spurious oscillations when they are used to solve those problems. A common approach to avoid this difficulty is to design a proper numerical scheme and/or a proper mesh so that the numerical solution validates the discrete counterpart (DMP) of the maximum principle satisfied by the continuous solution. A well known mesh condition for the DMP satisfaction by the linear finite element solution of isotropic diffusion problems is the non-obtuse angle condition that requires the dihedral angles of mesh elements to be non-obtuse. In this paper, a generalization of the condition, the so-called anisotropic non-obtuse angle condition, is developed for the finite element solution of heterogeneous anisotropic diffusion problems. The new condition is essentially the same as the existing one except that the dihedral angles are now measured in a metric depending on the diffusion matrix of the underlying problem. Several variants of the new condition are obtained. Based on one of them, two metric tensors for use in anisotropic mesh generation are developed to account for DMP satisfaction and the combination of DMP satisfaction and mesh adaptivity. Numerical examples are given to demonstrate the features of the linear finite element method for anisotropic meshes generated with the metric tensors.Comment: 34 page

Optimal Point Placement for Mesh Smoothing

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '9

Discrete conformal maps and ideal hyperbolic polyhedra

We establish a connection between two previously unrelated topics: a particular discrete version of conformal geometry for triangulated surfaces, and the geometry of ideal polyhedra in hyperbolic three-space. Two triangulated surfaces are considered discretely conformally equivalent if the edge lengths are related by scale factors associated with the vertices. This simple definition leads to a surprisingly rich theory featuring M\"obius invariance, the definition of discrete conformal maps as circumcircle preserving piecewise projective maps, and two variational principles. We show how literally the same theory can be reinterpreted to addresses the problem of constructing an ideal hyperbolic polyhedron with prescribed intrinsic metric. This synthesis enables us to derive a companion theory of discrete conformal maps for hyperbolic triangulations. It also shows how the definitions of discrete conformality considered here are closely related to the established definition of discrete conformality in terms of circle packings.Comment: 62 pages, 22 figures. v2: typos corrected, references added and updated, minor changes in exposition. v3, final version: typos corrected, improved exposition, some material moved to appendice

Phase field theory of interfaces and crystal nucleation in a eutectic system of fcc structure: I. Transitions in the one-phase liquid region

The published version of this Article can be accessed from the link below - Copyright @ 2007 American Institute of PhysicsThe phase field theory (PFT) has been applied to predict equilibrium interfacial properties and nucleation barrier in the binary eutectic system Ag-Cu using double well and interpolation functions deduced from a Ginzburg-Landau expansion that considers fcc (face centered cubic) crystal symmetries. The temperature and composition dependent free energies of the liquid and solid phases are taken from CALculation of PHAse Diagrams-type calculations. The model parameters of PFT are fixed so as to recover an interface thickness of approximately 1 nm from molecular dynamics simulations and the interfacial free energies from the experimental dihedral angles available for the pure components. A nontrivial temperature and composition dependence for the equilibrium interfacial free energy is observed. Mapping the possible nucleation pathways, we find that the Ag and Cu rich critical fluctuations compete against each other in the neighborhood of the eutectic composition. The Tolman length is positive and shows a maximum as a function of undercooling. The PFT predictions for the critical undercooling are found to be consistent with experimental results. These results support the view that heterogeneous nucleation took place in the undercooling experiments available at present. We also present calculations using the classical droplet model classical nucleation theory (CNT) and a phenomenological diffuse interface theory (DIT). While the predictions of the CNT with a purely entropic interfacial free energy underestimate the critical undercooling, the DIT results appear to be in a reasonable agreement with the PFT predictions.This work has been supported by the Hungarian Academy of Sciences under Contract No. OTKA-K-62588 and by the ESA PECS Contract Nos. 98005, 98021, and 98043

An Algorithm for Triangulating 3D Polygons

In this thesis, we present an algorithm for obtaining a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angles between adjacent triangles. Our algorithm generalizes a classical method for optimally triangulating a single polygon. The key novelty is a mechanism for avoiding non-manifold outputs for two and more input polygons without compromising opti- mality. For better performance on real-world data, we also propose an approximate solution by feeding the algorithm with a reduced set of triangles. In particular, we demonstrate experimentally that the triangles in the Delaunay tetrahedralization of the polygon vertices offer a reasonable trade off between performance and optimality

Edge-Sharpener: A geometric filter for recovering sharp features in uniform triangulations

3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align the samples with the sharp edges and corners of the original shape. Consequently, the interpolating triangle meshes chamfer these sharp features and thus exhibit significant errors. The new Edge-Sharpener filter introduced here identifies the chamfer edges and subdivides them and their incident triangles by inserting new vertices and by forcing these vertices to lie on intersections of planes that locally approximate the smooth surfaces that meet at these sharp features. This post-processing significantly reduces the error produced by the initial sampling process. For example, we have observed that the L2 error introduced by the SwingWrapper9 remeshing-based compressor can be reduced down to a fifth by executing Edge-Sharpener after decompression, with no additional information