GithubHelp home page GithubHelp logo

lddl / horizon Goto Github PK

View Code? Open in Web Editor NEW
44.0 44.0 6.0 25.37 MB

Map matching (snapping GPS points to road graph) and routing library in Go

License: Apache License 2.0

Go 99.04% Shell 0.59% HTML 0.36%
hacktoberfest hidden-markov-model hmm hmm-viterbi-algorithm horizon map-matching routing-engine

horizon's Introduction

Welcome to my cosy repos page!

counter

Developer in computer vision / telemetry (GPS) fields

  • ๐Ÿ’ผ Iโ€™m currently working on a Horizon - map matching library for GPS tracks; and ODaM - Object Detection and Monitoring via GoCV and go-darknet; and Generative Adversarial Networks (GANs) in Golang - https://github.com/LdDl/gan-go
  • ๐Ÿฅ… My current goals: improve hobby projects quality and contribute to open source, implement GAN and other interesting neural networks architectures in Golang, learn Rust programming language (oh, here is my toy project for road traffic monitoring in Rust).
  • ๐Ÿ“– Interests: applied mathematics, neural networks, graph theory

Connect with me:

LdDl LdDl | Twitter LdDl | LinkedIn


Languages and Tools:

Golang Visual Studio Code PostgreSQL GraphQL Rust Git GitHub Gorgonia Terminal Ubuntu

Support:

You witness me, I'm happy.


LdDl's Github Stats

@lddl's Holopin board

horizon's People

Contributors

dependabot[bot] avatar lddl avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

horizon's Issues

[FEATURE REQUEST / question] ellipsoidal model for distance

Hello,
For mitigating the distortion error in distance, $r$, arisen from spherical model (= S2 geometry), I think that ellipsoidal model would be better, and it would traditionally consist of the following:

Do you have any ideas about it?

  • Ellipsoidal model is differentially (i.e., in short range) represented as follows:

$$ \begin{align} dr &= \sqrt{dE^2+dN^2} \\ dE &= \left(\frac{R}{\sqrt{1-e^2\sin^2 \phi }}\right) \cos \phi d \lambda \\ dN &= \left(\frac{R\ (1- e^2)}{\left(1-e^2 \sin^2 \phi\right)^{3/2}}\right) d \phi \\ \end{align} $$

  • The Braun projection is represented as follows:

$$ \begin{align} x &= R\lambda \\ y &= 2 R \tan \frac{\phi}{2} \\ \chi &= \tan \frac{\phi}{2} \\ d \phi &= \frac{2}{1 + \chi^2} d \chi \\ \cos \phi &= \frac{1 - \chi^2 }{1 + \chi^2}\\ \sin \phi &= \frac{2 \chi}{1 + \chi^2} \end{align} $$

[FEATURE REQUEST|DOCUMENTATION] Swagger docs

Is your feature request related to a problem? Please describe.
Whould be cool to have swagger documentation for REST-part of applications

Describe the solution you'd like and provide pseudocode examples if you can
Use tool swag for doc generation + do route 'host:port/api/docs/' via Fiber for serving static files
Use rapidoc for visual representation of swagger specification

Describe alternatives you've considered and provide pseudocode examples if you can
nope

Additional context
nope

Installation issue

When trying to install horizon getting following error
Please help me if I am doing something wrong

image

Thanks

[QUESTION] Edge- or vertex-based model?

Hello,
Which does horizon use, edge-based or vertex-based algorithm/model?

I think that the edge-based one can be represented by the trellis transition diagram whose nodes correspond to road-network links (=edges), which can handle multiple edges in a multigraph of road network, whereas the vertex-based one's nodes correspond to road-network nodes.

[FEATURE REQUEST] Isochrones REST API

Is your feature request related to a problem? Please describe.
We need REST server-side for isochrones building

Describe the solution you'd like and provide pseudocode examples if you can
CH-library gives us opportunity to calculate isochrones.
So just wrap this into service which would

  1. accepts WGS84 Point and cost restriction.
  2. calculates nearest possible vertex
  3. calcuates isochrones via CH-library
  4. prepares output as polygons or polylines (it depends on what we want: edges geom with 'colorized' attributes, or polygons built on top of edges' vertices with same 'colorization'), or plain points with costs info

Describe alternatives you've considered and provide pseudocode examples if you can
nope

Additional context
Would be awesome to have client-side example also
Wiki: https://en.wikipedia.org/wiki/Isochrone_map

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.