GitHub / darian-catalin-cucer / convex-hull

The Convex Hull is a computational geometry concept defining the smallest convex polygon containing a set of points in a plane. Used in fields like computer graphics, robotics & pattern recognition, the Convex Hull algorithm finds the boundary of a cluster or minimum bounding box of points. This code repo has an implementation in Kotlin.

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fconvex-hull

Topics: api, apis, code, convex, convex-hull, cpp, html, java, javascript, js, kotlin, open-source, plane, rest, rest-api, robotics, robots

Files

No dependencies found