Is there any open-source implementation of n*log(n) visibility graph construction algorithm?

I'm trying to understand S. K. GHOSH and D. M. MOUNT sweep line algorithm, but it's known for having very hard implementation. It would be great if I saw at least some implementation, in any programming language. Or in pseudo-code.

  • $\begingroup$ I looking for this type of algorithm. Have you found any implementation or replacent?? $\endgroup$ – user43968 Jun 3 '18 at 9:44
  • $\begingroup$ @user43968, well, unfortunately none of them are simple. Currently I'm trying to implement this one with continious dijkstra approach. It's not nlog(n), but it's subquadratic, which is not bad too dl.acm.org/citation.cfm?id=161156. $\endgroup$ – Olologin Jun 4 '18 at 11:49

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.