Editing List of algorithms (section)

===Geometry===
{{main category|Geometric algorithms}}
{{further|Computational geometry}}
* [[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 (mathematics)|set]] of points
** [[Graham scan]]
** [[Quickhull]]
** [[Gift wrapping algorithm]] or Jarvis march
** [[Chan's algorithm]]
** [[Kirkpatrick–Seidel algorithm]]
* [[Euclidean distance map|Euclidean distance transform]]: computes the distance between every point in a grid and a discrete collection of points.
* [[Geometric hashing]]: a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an [[affine transformation]]
* [[Gilbert–Johnson–Keerthi distance algorithm]]: determining the smallest distance between two [[convex set|convex]] shapes.
* [[Jump-and-Walk algorithm]]: an algorithm for point location in triangulations
* [[Laplacian smoothing]]: an algorithm to smooth a polygonal mesh
* [[Line segment intersection]]: finding whether lines intersect, usually with a [[sweep line algorithm]]
** [[Bentley–Ottmann algorithm]]
** [[Shamos–Hoey algorithm]]
* [[Minimum bounding box algorithms]]: find the [[Minimum bounding box#Arbitrarily oriented minimum bounding box|oriented minimum bounding box]] enclosing a set of points
* [[Nearest neighbor search]]: find the nearest point or points to a query point
* [[Nesting algorithm]]: make the most efficient use of material or space
* [[Point in polygon]] algorithms: tests whether a given point lies within a given polygon
* [[Point set registration]] algorithms: finds the transformation between two [[point cloud|point sets]] to optimally align them.
* [[Rotating calipers]]: determine all [[antipodal point|antipodal]] pairs of points and vertices on a [[convex polygon]] or [[convex hull]].
* [[Shoelace algorithm]]: determine the area of a polygon whose vertices are described by ordered pairs in the plane
* [[Triangulation (geometry)|Triangulation]]
** [[Delaunay triangulation]]
*** [[Ruppert's algorithm]] (also known as Delaunay refinement): create quality Delaunay triangulations
*** [[Chew's second algorithm]]: create quality [[constrained Delaunay triangulation]]s
** [[Marching triangles]]: reconstruct two-dimensional surface geometry from an unstructured [[point cloud]]
** [[Polygon triangulation]] algorithms: decompose a polygon into a set of triangles
** [[Voronoi diagram]]s, geometric [[duality (mathematics)|dual]] of [[Delaunay triangulation]]
*** [[Bowyer–Watson algorithm]]: create voronoi diagram in any number of dimensions
*** [[Fortune's Algorithm]]: create voronoi diagram
** [[Quasitriangulation]]