Skip to content
#

plane

Here are 4 public repositories matching this topic...

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.

  • Updated Feb 8, 2023
  • Kotlin

Improve this page

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

Curate this topic

Add this topic to your repo

To associate your repository with the plane topic, visit your repo's landing page and select "manage topics."

Learn more