-
Notifications
You must be signed in to change notification settings - Fork 17
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Showing
4 changed files
with
226 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,96 @@ | ||
use crate::error::Result; | ||
use crate::{GeometryArray, GeometryArrayTrait}; | ||
use arrow2::array::{MutablePrimitiveArray, PrimitiveArray}; | ||
use geo::prelude::ChamberlainDuquetteArea; | ||
|
||
/// Calculate the unsigned approximate geodesic area of geometries on a sphere using the algorithm | ||
/// presented in Some Algorithms for Polygons on a Sphere by Chamberlain and Duquette (2007) | ||
pub fn chamberlain_duquette_unsigned_area(array: GeometryArray) -> Result<PrimitiveArray<f64>> { | ||
let mut output_array = MutablePrimitiveArray::<f64>::with_capacity(array.len()); | ||
|
||
match array { | ||
GeometryArray::WKB(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::Point(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::LineString(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::Polygon(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::MultiPoint(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::MultiLineString(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
GeometryArray::MultiPolygon(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_unsigned_area())) | ||
}); | ||
} | ||
} | ||
|
||
Ok(output_array.into()) | ||
} | ||
|
||
/// Calculate the signed approximate geodesic area of geometries on a sphere using the algorithm | ||
/// presented in Some Algorithms for Polygons on a Sphere by Chamberlain and Duquette (2007) | ||
pub fn chamberlain_duquette_signed_area(array: GeometryArray) -> Result<PrimitiveArray<f64>> { | ||
let mut output_array = MutablePrimitiveArray::<f64>::with_capacity(array.len()); | ||
|
||
match array { | ||
GeometryArray::WKB(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::Point(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::LineString(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::Polygon(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::MultiPoint(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::MultiLineString(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
GeometryArray::MultiPolygon(arr) => { | ||
arr.iter_geo().for_each(|maybe_g| { | ||
output_array.push(maybe_g.map(|g| g.chamberlain_duquette_signed_area())) | ||
}); | ||
} | ||
} | ||
|
||
Ok(output_array.into()) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,122 @@ | ||
use crate::error::Result; | ||
use crate::{GeometryArray, GeometryArrayTrait}; | ||
use arrow2::array::{MutablePrimitiveArray, PrimitiveArray}; | ||
use geo::prelude::GeodesicArea; | ||
|
||
/// Calculate the unsigned geodesic area of a geometry on an ellipsoid using the algorithm | ||
/// presented in Algorithms for geodesics by Charles Karney (2013) | ||
pub fn geodesic_area_unsigned(array: GeometryArray) -> Result<PrimitiveArray<f64>> { | ||
let mut output_array = MutablePrimitiveArray::<f64>::with_capacity(array.len()); | ||
|
||
match array { | ||
GeometryArray::WKB(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::Point(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::LineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::Polygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::MultiPoint(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::MultiLineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
GeometryArray::MultiPolygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_unsigned()))); | ||
} | ||
} | ||
|
||
Ok(output_array.into()) | ||
} | ||
|
||
/// Calculate the signed geodesic area of a geometry on an ellipsoid using the algorithm | ||
/// presented in Algorithms for geodesics by Charles Karney (2013) | ||
pub fn geodesic_area_signed(array: GeometryArray) -> Result<PrimitiveArray<f64>> { | ||
let mut output_array = MutablePrimitiveArray::<f64>::with_capacity(array.len()); | ||
|
||
match array { | ||
GeometryArray::WKB(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::Point(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::LineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::Polygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::MultiPoint(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::MultiLineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
GeometryArray::MultiPolygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_area_signed()))); | ||
} | ||
} | ||
|
||
Ok(output_array.into()) | ||
} | ||
|
||
/// Determine the perimeter of a geometry on an ellipsoidal model of the earth. | ||
/// | ||
/// This uses the geodesic measurement methods given by Karney (2013). | ||
pub fn geodesic_perimeter(array: GeometryArray) -> Result<PrimitiveArray<f64>> { | ||
let mut output_array = MutablePrimitiveArray::<f64>::with_capacity(array.len()); | ||
|
||
match array { | ||
GeometryArray::WKB(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::Point(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::LineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::Polygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::MultiPoint(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::MultiLineString(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
GeometryArray::MultiPolygon(arr) => { | ||
arr.iter_geo() | ||
.for_each(|maybe_g| output_array.push(maybe_g.map(|g| g.geodesic_perimeter()))); | ||
} | ||
} | ||
|
||
Ok(output_array.into()) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters