An implementation of the Conrec Algorithm (http://paulbourke.net/papers/conrec/) for Java

In contrast to most implementation, this implementation doesn't rely on a drawing method. Instead, ConrecContour objects are optimally instantiated and filled with the points making up the contour. This allows the contours to be exchanged, for example, between a server and a browser.

double[] x, y, z = ...
double[] levels = ...

// Compute the iso-contours for some levels
List<ConrecLevel> levels = Conrec.contour(x, y, z, levels);

// Get the computed contours at the first level
List<ConrecContour> contours = levels.get(0).getContours();

// Get the points composing the first contour
List<ConrecPoint> points = contours.get(0).getPoints();

Execution time on a set of 200 real-world data ranging from 500K to 4M data points (20 levels).

See BenchmarkTest.java for more details.

• Improve unit test coverage
• Publish to Maven Central