S-hull algorithm for creating Delaunay Triangulation
The Delaunay triangulation [1] is a useful concept in graph theory and spatial data analysis. S-Hull [2] is a recent algorithm published for faster creation of a Delaunay triangulation of a point set. A Java implementation of S-Hull algorithm can be located at [3].
To try this implementation out, clone the git repository [4] and run it following the instructions in my previous blog post. When you get to the UI, there are two buttons in the tool bar with text labels. When you click on them following Delaunay triangulation will be plotted.
References
[1] https://en.wikipedia.org/wiki/Delaunay_triangulation
[2] https://arxiv.org/abs/1604.01428
[3] https://github.com/sameerak/GeoDataAnalysis/blob/master/src/main/java/au/edu/unimelb/cis/geo/controller/DelaunayTriangulation.java
[4] https://github.com/sameerak/GeoDataAnalysis
To try this implementation out, clone the git repository [4] and run it following the instructions in my previous blog post. When you get to the UI, there are two buttons in the tool bar with text labels. When you click on them following Delaunay triangulation will be plotted.
References
[1] https://en.wikipedia.org/wiki/Delaunay_triangulation
[2] https://arxiv.org/abs/1604.01428
[3] https://github.com/sameerak/GeoDataAnalysis/blob/master/src/main/java/au/edu/unimelb/cis/geo/controller/DelaunayTriangulation.java
[4] https://github.com/sameerak/GeoDataAnalysis
Comments
Post a Comment