Discover published sets by community

Algorithms that find the convex hull of a set of points, which is the smallest convex polygon containing all the points. Example: Graham's Scan or Quickhull are used to solve Convex Hull determination problems.

This refers to algorithms that determine if any two of a collection of line segments intersect. Bentley-Ottmann algorithm and the Sweep line algorithm are well-known for this purpose.

The process of subdividing a polygonal area into triangles, which have various applications including computer graphics and numerical simulations. The Ear clipping method and Delaunay triangulation are common strategies.

Refers to algorithms that preprocess a set of geometric objects to answer various range queries efficiently. Examples include K-d trees and Range trees to solve problems like listing points within a rectangle.

A partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other. Used in various fields such as meteorology, biology, and mining.