pelorus 0.1.0

A high-performance GPS map-matching library for geospatial road network processing
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

use geo::{Closest, LineString, Point};

pub type SegmentId = u32;
pub type IntersectionId = u32;
pub type Timestamp = f64;

#[derive(Debug, Clone, PartialEq)]
pub struct GpsMeasurement {
    pub point: Point<f64>,
    pub timestamp: Timestamp,
}

#[derive(Debug, Clone, PartialEq)]
pub struct RoadSegment {
    pub id: SegmentId,
    pub geometry: LineString<f64>,
}

#[derive(Debug, Clone, PartialEq)]
pub struct CandidatePoint<'a> {
    pub segment_id: SegmentId,
    pub segment: &'a RoadSegment,
    pub gps_point: Point<f64>,
}

impl<'a> CandidatePoint<'a> {
    pub fn projected_point(&self) -> Result<Point<f64>, &'static str> {
        use geo::algorithm::closest_point::ClosestPoint;
        match self.segment.geometry.closest_point(&self.gps_point) {
            Closest::SinglePoint(point) => Ok(point),
            Closest::Intersection(point) => Ok(point),
            Closest::Indeterminate => Err(
                "Cannot determine closest point on segment - geometry may be malformed",
            ),
        }
    }

    pub fn distance_to_gps(&self) -> f64 {
        // TODO: Distance is currently unitless (degrees), should convert to meters
        use geo::algorithm::euclidean_distance::EuclideanDistance;
        self.segment.geometry.euclidean_distance(&self.gps_point)
    }
}