[go: up one dir, main page]

geo 0.4.1

Geospatial primitives and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

/// Calculation of the centroid.
pub mod centroid;
/// Checks if the geometry A is completely inside the B geometry.
pub mod contains;
/// hecks if the geometry A intersects the geometry B.
pub mod intersects;
/// Returns the area of the surface of geometry
pub mod area;
/// Returns the length of a line.
pub mod length;
/// Returns the distance between two geometries.
pub mod distance;
/// Returns the distance between two geometries.
pub mod haversine_distance;
/// Returns the Bbox of a geometry.
pub mod boundingbox;
/// Simplifies a `LineString` using the Ramer-Douglas-Peucker algorithm.
pub mod simplify;
/// Simplifies a `LineString` using the Visvalingam-Whyatt algorithm.
pub mod simplifyvw;
/// Calculates the convex hull of a `Polygon`
pub mod convexhull;