Map of the study area with the boundary indicated in brown, ground control points identified with squares, and the field sampled knees identified with circles. We randomly selected 55 knees for ...

Add a description, image, and links to the concave-hull topic page so that developers can more easily learn about it.

uhull is a Python package that provides a new algorithm for obtaining the concave hull of 2D point sets. The algorithm works exceptionally well with 'disconnected' sets and outlier points.

Holy Cross Energy brings NREL algorithms out of the lab and into homes, setting a national example for grid control. Nearly every major U.S. city has set renewable energy goals that will require ...

Abstract: Support vector machine (SVM) is not suitable for classification on large data sets due to its training complexity. Convex hull can simplify SVM training, however the classification accuracy ...

Abstract: This paper presents an algorithm to determine whether a point-set composed of n-points is in the polyhedron or not-which is called the convex hull method. With this method, it is not ...

ABSTRACT: Emulating massively parallel computer architectures represents a very important tool for the parallel programmers. It allows them to implement and validate their algorithms. Due to the high ...