Source code for computing a 'Visibility Graph' in java
ok. Its a basic (naive) visibility graph that i need that will use use a 'sweeping' method in a clockwise direction. It should display all the vertices that can see each other joining them with a line. The obstacles are polygons. It will be used with the dijkstra algorithm to find the shortest path which will be a sequence of the lines created by the visibility graph.
It’s our mission to create a product that solves the huge challenges you face at work every day. In case you missed it, here are 7 delightful things we've added recently to monday to make it even more awesome.