TL;DR: In this article, the authors present a gallery of grid generation in three dimensions and on Curves and Surfaces, with a focus on grid generation on the line and on contravariant functionals.
Abstract: Preliminaries. Application to Hosted Equations. Grid Generation on the Line. Vector Calculus and Differential Geometry. Classical Planar Grid Generation. Variational Planar Grid Generation. Tensor Analysis and Transformation Relationships. Advanced Planar Variational Grid Generation. Grid Generation in Three Dimensions. Variational Grid Generation on Curves and Surfaces. Contravariant Functionals: Alignment and Diagonalization. Tensor Coefficients. Fortran Code Directory. A Rogue's Gallery of Grids.
TL;DR: The Yin-Yang grid as discussed by the authors is composed of two identical component grids that are combined in a complemental way to cover a spherical surface with partial overlap on their boundaries, and the grid spacing is quasi-uniform.
Abstract: [1] A new kind of overset grid, named Yin-Yang grid, for spherical geometry is proposed. The Yin-Yang grid is composed of two identical component grids that are combined in a complemental way to cover a spherical surface with partial overlap on their boundaries. Each component grid is a low-latitude part of the latitude-longitude grid. Therefore the grid spacing is quasi-uniform, and the metric tensors are simple and analytically known. One can directly apply mathematical and numerical resources that have been written in the spherical polar coordinates or latitude-longitude grid. The complemental combination of the two identical component grids enables us to make efficient and concise programs. Simulation codes for geodynamo and mantle convection simulations using finite difference scheme based on the Yin-Yang grid are developed and tested. The Yin-Yang grid is suitable for massively parallel computers.
TL;DR: A general rezone strategy that ensures the continuing geometric quality of the computational grid, while keeping the "rezoned" grid as close as possible to the Lagrangian grid at each time step is described.
TL;DR: A trio of new trigonometric functions are defined in this paper to facilitate the rotation transformations and a fast algorithm for rounding an arbitrary point to the nearest hexagonal grid point is presented.
Abstract: The hexagonal grid has long been known to be superior to the more traditional rectangular grid system in many aspects in image processing and machine vision related fields. However, systematic developments of the mathematical backgrounds for the hexagonal grid are conspicuously lacking. The purpose of this paper is to study geometric transformations on the hexagonal grid. Formulations of the transformation matrices are carried out in a symmetrical hexagonal coordinate frame. A trio of new trigonometric functions are defined in this paper to facilitate the rotation transformations. A fast algorithm for rounding an arbitrary point to the nearest hexagonal grid point is also presented. >
TL;DR: In this article, a system for restricting grid software applications performing on a grid computer of the computing grid is described. But the system is restricted to a single grid application and does not consider the grid computer itself.
Abstract: A system is disclosed for restricting operations of a grid software application performing on a grid computer of the computing grid. The system includes a method that presents a user of the grid computer with an option governing use of the grid computer by computing grid operations performed on the grid computer, accepting from the user a setting of options governing use of the grid computer, and applying the setting of the options governing use of the grid computer to the computing grid operations performed on the grid computer.