use ndarray::{Array1, Array2, ArrayView1, ArrayView2};
use crate::geometry::manifold::{
GEOMETRY_EPS, GeometryError, GeometryResult, RiemannianManifold, check_len, dot, identity,
zero_christoffel,
};
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct EuclideanManifold {
dim: usize,
}
impl EuclideanManifold {
pub const fn new(dim: usize) -> Self {
Self { dim }
}
}
impl RiemannianManifold for EuclideanManifold {
fn dim(&self) -> usize {
self.dim
}
fn tangent_basis(&self, point: ArrayView1<'_, f64>) -> GeometryResult<Array2<f64>> {
check_len("Euclidean point", point.len(), self.dim)?;
Ok(identity(self.dim))
}
fn exp_map(
&self,
point: ArrayView1<'_, f64>,
tangent_vec: ArrayView1<'_, f64>,
) -> GeometryResult<Array1<f64>> {
check_len("Euclidean point", point.len(), self.dim)?;
check_len("Euclidean tangent", tangent_vec.len(), self.dim)?;
Ok(&point + &tangent_vec)
}
fn log_map(
&self,
p_from: ArrayView1<'_, f64>,
p_to: ArrayView1<'_, f64>,
) -> GeometryResult<Array1<f64>> {
check_len("Euclidean source", p_from.len(), self.dim)?;
check_len("Euclidean target", p_to.len(), self.dim)?;
Ok(&p_to - &p_from)
}
fn parallel_transport(
&self,
point_along: ArrayView2<'_, f64>,
vec: ArrayView1<'_, f64>,
) -> GeometryResult<Array1<f64>> {
if point_along.nrows() > 0 {
check_len("Euclidean path width", point_along.ncols(), self.dim)?;
}
check_len("Euclidean transported vector", vec.len(), self.dim)?;
Ok(vec.to_owned())
}
fn metric_tensor(&self, point: ArrayView1<'_, f64>) -> GeometryResult<Array2<f64>> {
check_len("Euclidean metric point", point.len(), self.dim)?;
Ok(identity(self.dim))
}
fn riemannian_gradient(
&self,
point: ArrayView1<'_, f64>,
euclidean_grad: ArrayView1<'_, f64>,
) -> GeometryResult<Array1<f64>> {
self.project_tangent(point, euclidean_grad)
}
fn christoffel_symbols(&self, point: ArrayView1<'_, f64>) -> GeometryResult<Vec<Array2<f64>>> {
check_len("Euclidean Christoffel point", point.len(), self.dim)?;
Ok(zero_christoffel(self.dim))
}
fn sectional_curvature(
&self,
point: ArrayView1<'_, f64>,
tangent_pair: (ArrayView1<'_, f64>, ArrayView1<'_, f64>),
) -> GeometryResult<f64> {
check_len("Euclidean curvature point", point.len(), self.dim)?;
check_len(
"Euclidean curvature tangent u",
tangent_pair.0.len(),
self.dim,
)?;
check_len(
"Euclidean curvature tangent v",
tangent_pair.1.len(),
self.dim,
)?;
if self.dim < 2 {
return Err(GeometryError::Unsupported(
"sectional curvature is undefined on a manifold of dimension below 2",
));
}
let uu = dot(tangent_pair.0, tangent_pair.0);
let vv = dot(tangent_pair.1, tangent_pair.1);
let uv = dot(tangent_pair.0, tangent_pair.1);
let area_sq = uu * vv - uv * uv;
if !area_sq.is_finite() || area_sq <= GEOMETRY_EPS {
return Err(GeometryError::Singular(
"sectional curvature undefined for collinear/degenerate tangent pair",
));
}
Ok(0.0)
}
}
#[cfg(test)]
mod tests {
use super::EuclideanManifold;
use crate::geometry::manifold::{GeometryError, RiemannianManifold};
use ndarray::array;
#[test]
fn sectional_curvature_is_zero_on_nondegenerate_plane() {
let m = EuclideanManifold::new(2);
let point = array![0.0, 0.0];
let u = array![1.0, 0.0];
let v = array![0.0, 1.0];
let k = m
.sectional_curvature(point.view(), (u.view(), v.view()))
.expect("flat space has defined curvature on a nondegenerate plane");
assert!(k.abs() < 1.0e-12, "expected 0, got {k}");
}
#[test]
fn sectional_curvature_is_singular_for_collinear_pair() {
let m = EuclideanManifold::new(2);
let point = array![0.0, 0.0];
let u = array![1.0, 0.0];
let v = array![3.0, 0.0];
match m.sectional_curvature(point.view(), (u.view(), v.view())) {
Err(GeometryError::Singular(_)) => {}
other => panic!("expected Singular for collinear pair, got {other:?}"),
}
}
#[test]
fn sectional_curvature_is_unsupported_below_two_dimensions() {
let m = EuclideanManifold::new(1);
let point = array![0.0];
let u = array![1.0];
let v = array![1.0];
match m.sectional_curvature(point.view(), (u.view(), v.view())) {
Err(GeometryError::Unsupported(_)) => {}
other => panic!("expected Unsupported in 1-D, got {other:?}"),
}
}
}