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.

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.

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 problem of locating a point within a spatial subdivision of the plane efficiently. Data structures like Trapezoidal maps or the Kirkpatrick's data structure are used for solving point location queries.

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.