- Barycentric subdivision
- Newton–Raphson division
- Closest pair problem: find the pair of points (from a set of points) with the smallest distance between them
- Collision detection algorithms: check for the collision or intersection of two given solids
- Cone algorithm: identify surface points
- Convex hull algorithms: determining the convex hull of a set of points
- Graham scan
- QuickHull
- Gift wrapping algorithm or Jarvis march
- Chan's algorithm