Clever Geek Handbook

Farthest Voronoi diagram in Java

I'm looking for a naive algorithm to find the farthest point of a Voronoi diagram. The dimensions of the input won't be big enough when I need something complex and since I can't find Java libraries.

I was hoping someone could describe a simple algorithm that shouldn't be too hard to compute?

thank

+2


source to share


2 answers


You can find the pseduocode algorithm for the Voronoi diagram with the highest point here . Java code written by the same person is here .



+3


source


I know this is a fairly late addition, but you can take a look at the Tektosyne library .



It can generate Voronoi and Delaunay triangulation diagrams with conversion to DCEL subdivisions and supports graph algorithms such as A * pathfinding, path coverage, fill fill, sigh line.

0


source






More articles:


All Articles