| org.deegree.crs.projections.Projection org.deegree.crs.projections.conic.ConicProjection
All known Subclasses: org.deegree.crs.projections.conic.LambertConformalConic,
ConicProjection | abstract public class ConicProjection extends Projection (Code) | | The ConicProjection is a super class for all conic projections.
(From Snyder p.97)
To show a region for which the greatest extent is from east to west in the temperate zones, conic projections are
usually preferable to cylindrical projections.
Normal conic projections are distinguished by the use of arcs of concentric circles for parallesl of latitude and
equally spaced straight radii of these circles for meridians. The angles between the meridians on the map are smaller
than the actual differences in longitude. The circular arcs may or may not be equally spaced, depending on the
projections. The polyconic projections and the oblique conic projections have characteristcs different from these.
There are three important classes of conic projections:
- The equidistant
- the conformal
- the equal area
author: Rutger Bezema author: last edited by: $Author:$ version: $Revision:$, $Date:$ |
Constructor Summary | |
public | ConicProjection(double firstParallelLatitude, double secondParallelLatitude, GeographicCRS geographicCRS, double falseNorthing, double falseEasting, Point2d naturalOrigin, Unit units, double scale, boolean conformal, boolean equalArea, String[] identifiers, String[] names, String[] versions, String[] descriptions, String[] areasOfUse) Parameters: firstParallelLatitude - the latitude (in radians) of the first parallel. |
Method Summary | |
public boolean | equals(Object other) | final public double | getFirstParallelLatitude() the latitude of the first parallel which is the intersection of the earth with the cone or theprojectionLatitude if the cone is tangential with earth (e.g. | final public double | getSecondParallelLatitude() the latitude of the first parallel which is the intersection of the earth with the cone or theprojectionLatitude if the cone is tangential with earth (e.g. | public int | hashCode() Implementation as proposed by Joshua Block in Effective Java (Addison-Wesley 2001), which supplies an even
distribution and is relatively fast. |
ConicProjection | public ConicProjection(double firstParallelLatitude, double secondParallelLatitude, GeographicCRS geographicCRS, double falseNorthing, double falseEasting, Point2d naturalOrigin, Unit units, double scale, boolean conformal, boolean equalArea, String[] identifiers, String[] names, String[] versions, String[] descriptions, String[] areasOfUse)(Code) | | Parameters: firstParallelLatitude - the latitude (in radians) of the first parallel. (Snyder phi_1). Parameters: secondParallelLatitude - the latitude (in radians) of the second parallel. (Snyder phi_2). Parameters: geographicCRS - Parameters: falseNorthing - Parameters: falseEasting - Parameters: naturalOrigin - Parameters: units - Parameters: scale - Parameters: conformal - Parameters: equalArea - Parameters: identifiers - Parameters: names - Parameters: versions - Parameters: descriptions - Parameters: areasOfUse - |
getFirstParallelLatitude | final public double getFirstParallelLatitude()(Code) | | the latitude of the first parallel which is the intersection of the earth with the cone or theprojectionLatitude if the cone is tangential with earth (e.g. one standard parallel). |
getSecondParallelLatitude | final public double getSecondParallelLatitude()(Code) | | the latitude of the first parallel which is the intersection of the earth with the cone or theprojectionLatitude if the cone is tangential with earth (e.g. one standard parallel). |
hashCode | public int hashCode()(Code) | | Implementation as proposed by Joshua Block in Effective Java (Addison-Wesley 2001), which supplies an even
distribution and is relatively fast. It is created from field f as follows:
- boolean -- code = (f ? 0 : 1)
- byte, char, short, int -- code = (int)f
- long -- code = (int)(f ^ (f >>>32))
- float -- code = Float.floatToIntBits(f);
- double -- long l = Double.doubleToLongBits(f); code = (int)(l ^ (l >>> 32))
- all Objects, (where equals( ) calls equals( ) for this field) -- code = f.hashCode( )
- Array -- Apply above rules to each element
Combining the hash code(s) computed above: result = 37 * result + code;
(int) ( result >>> 32 ) ^ (int) result; See Also: java.lang.Object.hashCode |
|
|