A O(n^2 log n) implementation of constructing a visibility graph
C C++
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
vgraph.dSYM/Contents
.gitignore
CImg.h
Makefile
README
Visibility_Graph_Algorithm.pdf
autorun.sh
data.cvs
data_space.cvs
geometry.h
line.cpp
line.h
node.h
plot.m
point.cpp
point.h
skiplist.h
vgraph.cpp

README

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

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