Package | Description |
---|---|
org.orekit.rugged.api | |
org.orekit.rugged.errors | |
org.orekit.rugged.intersection | |
org.orekit.rugged.intersection.duvenhage | |
org.orekit.rugged.refraction |
Modifier and Type | Method | Description |
---|---|---|
ExtendedEllipsoid |
Rugged.getEllipsoid() |
Get the observed body ellipsoid.
|
ExtendedEllipsoid |
RuggedBuilder.getEllipsoid() |
Get the ellipsoid.
|
Modifier and Type | Method | Description |
---|---|---|
static void |
DumpManager.dumpEllipsoid(ExtendedEllipsoid ellipsoid) |
Dump ellipsoid data.
|
static void |
DumpManager.dumpInverseLocation(LineSensor sensor,
org.orekit.bodies.GeodeticPoint point,
ExtendedEllipsoid ellipsoid,
int minLine,
int maxLine,
boolean lightTimeCorrection,
boolean aberrationOfLightCorrection,
boolean refractionCorrection) |
Dump an inverse location computation.
|
Modifier and Type | Method | Description |
---|---|---|
NormalizedGeodeticPoint |
BasicScanAlgorithm.intersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los) |
Compute intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
ConstantElevationAlgorithm.intersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los) |
Compute intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
IgnoreDEMAlgorithm.intersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los) |
Compute intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
IntersectionAlgorithm.intersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los) |
Compute intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
BasicScanAlgorithm.refineIntersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los,
NormalizedGeodeticPoint closeGuess) |
Refine intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
ConstantElevationAlgorithm.refineIntersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los,
NormalizedGeodeticPoint closeGuess) |
Refine intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
IgnoreDEMAlgorithm.refineIntersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los,
NormalizedGeodeticPoint closeGuess) |
Refine intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
IntersectionAlgorithm.refineIntersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los,
NormalizedGeodeticPoint closeGuess) |
Refine intersection of line with Digital Elevation Model.
|
Modifier and Type | Method | Description |
---|---|---|
NormalizedGeodeticPoint |
DuvenhageAlgorithm.intersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los) |
Compute intersection of line with Digital Elevation Model.
|
NormalizedGeodeticPoint |
DuvenhageAlgorithm.refineIntersection(ExtendedEllipsoid ellipsoid,
org.hipparchus.geometry.euclidean.threed.Vector3D position,
org.hipparchus.geometry.euclidean.threed.Vector3D los,
NormalizedGeodeticPoint closeGuess) |
Refine intersection of line with Digital Elevation Model.
|
Constructor | Description |
---|---|
MultiLayerModel(ExtendedEllipsoid ellipsoid) |
Simple constructor.
|
MultiLayerModel(ExtendedEllipsoid ellipsoid,
List<ConstantRefractionLayer> refractionLayers) |
Simple constructor.
|
Copyright © 2014-2019 CS Systèmes d'information. All rights reserved.