A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Abstract This paper describes a method of computing equal area elements (blocks) on the surface of a unit sphere. In this method, the surface is initially divided into a number of strips bounded by parallel circles. These strips are then divided into blocks with equal increment of longitude. The number of blocks may be different in different strips. Making use of this flexibility, we can (i) obtain blocks with ratios of (mean) horizontal sides to vertical sides that are close to unity (ii) minimize the number of polar blocks.
Abstract This paper describes a method of computing equal area elements (blocks) on the surface of a unit sphere. In this method, the surface is initially divided into a number of strips bounded by parallel circles. These strips are then divided into blocks with equal increment of longitude. The number of blocks may be different in different strips. Making use of this flexibility, we can (i) obtain blocks with ratios of (mean) horizontal sides to vertical sides that are close to unity (ii) minimize the number of polar blocks.
On computation of equal area blocks
Paul, M. K. (author)
1973
Article (Journal)
Electronic Resource
English
Geodäsie , Geometrie , Geodynamik , Mathematik , Mineralogie
| Online Contents | 1971
An adaptable equal-area pseudoconic map projection
| Online Contents | 2016
An adaptable equal-area pseudoconic map projection
| Online Contents | 2015
ESTIMATION PROBLEMS IN MODELS WITH SPATIAL WEIGHTING MATRICES WHICH HAVE BLOCKS OF EQUAL ELEMENTS
| Online Contents | 2006