Although there are many algorithms to construct Voronoi diagram, some of them are faster than others. Based on my knowledge Fortune algorithm is fastest for construct Voronoi diagram either in two dimensional or three dimensional. I search many forums but can't find any Fortune algorithm(Fortune's algorithm) code or a hint for Fortran.

So my question is: Is there any free Fortran code for Fortune algorithm in two dimensions or three dimensions?

Also, any kind of hint that makes the code writing easy for me is acceptable, for example flowchart. I don't know really it right to ask free source code here, so if I do wrong forgive me.

  • $\begingroup$ I found this one in GitHub: github.com/lanl/voronoi $\endgroup$
    – nicoguaro
    Commented Aug 8, 2020 at 15:23
  • $\begingroup$ @hardmath I added a wiki link for Fortune's algorithm. $\endgroup$
    – ALIN
    Commented Aug 9, 2020 at 9:02
  • $\begingroup$ The netlib repository has several Voronoi related packages, including Steve Fortune's 2D sweepline implementation in C. These are free for anyone to use, but come without support and may require licensing for commercial use with some packages. Perhaps you can search for "sweepline Fortran" to find additional resources? $\endgroup$
    – hardmath
    Commented Aug 10, 2020 at 1:51
  • $\begingroup$ @nicoguaro Thanks so much. I read that code I found that it is based on output of another prog. $\endgroup$
    – ALIN
    Commented Aug 19, 2020 at 5:43


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.