Skip to content

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

Notifications You must be signed in to change notification settings

minigo/visibility_graph

 
 

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

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

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 100.0%