- Gift wrapping. Determining the convex hull of a set of points.
- Gilbert-Johnson-Keerthi distance. Determining the smallest distance between two convex shapes.
- Graham scan. Determining the convex hull of a set of points in the plane.
- Line segment intersection. Finding whether lines intersect with a sweep line algorithm.
- Point in polygon. Tests whether a given point lies within a given.
- Ray/Plane intersection.
- Line/Triangle intersection. Particular case of Ray/Plane intersection.
- Polygonization of implicit surfaces. Approximate an implicit surface with a polygonal representation.
- Triangulation. Method to evaluate the distance to a point from angles to other points, whose distance is known.