Skip to content
/ roadgeometry-matching Public

[Library] implementation of a O(n log n) algorithm (fastest possible) for matching two sets of points placed in a roadmap; uses a modified capacity-scaling algorithm for flows on networks with convex costs on edges

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

kyletreleaven/roadgeometry-matching

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

121 Commits

d3

d3

 
 

setiptah

setiptah

 
 

.gitignore

.gitignore

 
 

README

README

 
 

construction_demo.py

construction_demo.py

 
 

construction_demo.tex

construction_demo.tex

 
 

match_scaling.py

match_scaling.py

 
 

matchvis_post.py

matchvis_post.py

 
 

setup.py

setup.py

 
 

Repository files navigation

Install with :
	python setup.py install

requires :
	numpy
	scipy
	networkx
	bintrees

Test: Run the setiptah/roadbm/bm.py module as a script.

About

[Library] implementation of a O(n log n) algorithm (fastest possible) for matching two sets of points placed in a roadmap; uses a modified capacity-scaling algorithm for flows on networks with convex costs on edges

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages