GitHub - davetcoleman/visibility_graph: A O(n^2 log n) implementation of constructing a visibility graph

Name		Name	Last commit message	Last commit date
vgraph.dSYM/Contents		vgraph.dSYM/Contents
.gitignore		.gitignore
CImg.h		CImg.h
LICENSE.md		LICENSE.md
Makefile		Makefile
README		README
Visibility_Graph_Algorithm.pdf		Visibility_Graph_Algorithm.pdf
autorun.sh		autorun.sh
data.cvs		data.cvs
data_space.cvs		data_space.cvs
geometry.h		geometry.h
line.cpp		line.cpp
line.h		line.h
node.h		node.h
plot.m		plot.m
point.cpp		point.cpp
point.h		point.h
skiplist.h		skiplist.h
vgraph.cpp		vgraph.cpp

Repository files navigation

Visibility Graph
A O(n^2 log n) implementation of constructing a visibility graph

by Dave Coleman <davetcoleman@gmail.com>
A project for Advanced Algorithms at CU Boulder

-------------