Parametric shortest-path algorithms via tropical geometry

We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.Comment: 24 pages and 8 figure

3D mesh refinement procedure using the bisection and rivara algorithms with mesh quality assessment

Mesh refinement procedures for the solution of three dimensional problems are described. The computational\ud domain is represented by an assembly of tetrahedral elements and the mesh refinement is acheived by the bisection\ud and Rivara methods using an explicit mesh density function coupled with an automatic 3D mesh generator.\ud A couple of benchmark examples is used to compare the performance of both refinement methods in terms of mesh\ud and size qualities, number of generated elements and CPU time consume

JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere

An algorithm for the generation of non-uniform, locally-orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi/Delaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally-orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a-priori bounds on element size and shape. Grid-quality is further improved through the application of hill-climbing type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution type studies is discussed in detail.Comment: Final revisions, as per: Engwirda, D.: JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere, Geosci. Model Dev., 10, 2117-2140, https://doi.org/10.5194/gmd-10-2117-2017, 201

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

Insertion of triangulated surfaces into a meccano tetrahedral discretization by means of mesh refinement and optimization procedures

This is the peer reviewed version of the following article: Ruiz Gironès , E., Oliver , A., Socorro, G., Cascón, J., Escobar, J.M., Montenegro, R., Sarrate, J. Insertion of triangulated surfaces into a meccano tetrahedral discretization by means of mesh refinement and optimization procedures. "International journal for numerical methods in engineering", 2018, which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/nme.5706/pdf. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.In this paper, we present a new method for inserting several triangulated surfaces into an existing tetrahedral mesh generated by the meccano method. The result is a conformal mesh where each inserted surface is approximated by a set of faces of the final tetrahedral mesh. First, the tetrahedral mesh is refined around the inserted surfaces to capture their geometric features. Second, each immersed surface is approximated by a set of faces from the tetrahedral mesh. Third, following a novel approach, the nodes of the approximated surfaces are mapped to the corresponding immersed surface. Fourth, we untangle and smooth the mesh by optimizing a regularized shape distortion measure for tetrahedral elements in which we move all the nodes of the mesh, restricting the movement of the edge and surface nodes along the corresponding entity they belong to. The refining process allows approximating the immersed surface for any initial meccano tetrahedral mesh. Moreover, the proposed projection method avoids computational expensive geometric projections. Finally, the applied simultaneous untangling and smoothing process delivers a high-quality mesh and ensures that the immersed surfaces are interpolated. Several examples are presented to assess the properties of the proposed method.Peer ReviewedPostprint (author's final draft