Category:Geometric algorithms
Wikimedia Commons has media related to Geometric algorithms.Category:Commons category link is on Wikidata
This category deals with algorithms in geometry. See also "Computational geometry".
Category:Combinatorial algorithms Category:Computational geometry Category:Geometry processingPages in category "Category:Geometric algorithms"
- Geometric algorithms
- Bentley–Ottmann algorithm
- Bitonic tour
- Boolean operations on polygons
- Bounding sphere
- Bounding volume
- Bowyer–Watson algorithm
- Bregman divergence
- Centroidal Voronoi tessellation
- CGAL
- Closest pair of points problem
- Cone algorithm
- Criss-cross algorithm
- Delaunay tessellation field estimator
- Delaunay triangulation
- Diameter (computational geometry)
- Euclidean shortest path
- Fan triangulation
- Fixed-radius near neighbors
- Fortune's algorithm
- Fréchet distance
- Function representation
- Geometric design
- Geometric median
- Geometric modeling
- Geometric primitive
- Geometric spanner
- Gilbert–Johnson–Keerthi distance algorithm
- Gilbert–Pollak conjecture
- Gradient pattern analysis
- Greedy geometric spanner
- Hierarchical RBF
- HyperFun
- JTS Topology Suite
- Katchalski-Katzir algorithm
- Largest empty rectangle
- Largest empty sphere
- Line fitting
- Line-cylinder intersection
- Line–line intersection
- Line–plane intersection
- Line–sphere intersection
- Linear programming
- Lloyd's algorithm
- Local feature size
- Marching triangles
- Mesh generation
- Midpoint circle algorithm
- Minimum bounding box
- Minimum bounding box algorithms
- Minimum bounding rectangle
- Minimum-diameter spanning tree
- Minkowski addition
- Minkowski Portal Refinement
- Möller–Trumbore intersection algorithm
- Monotone polygon
- Multiple line segment intersection
- Nearest neighbor search
- Nesting algorithm
- List of numerical computational geometry topics
- Planar straight-line graph
- Plane–plane intersection
- Point in polygon
- Point location
- Progressive-iterative approximation method
- Proximity problems
- Prune and search
- Ramer–Douglas–Peucker algorithm
- Rectangle packing
- Rectilinear Steiner tree
- Rotating calipers
- Shoelace formula
- Space partitioning
- Spatial database
- Star-shaped polygon
- Steiner tree problem
- Stencil jumping
- Surface-to-surface intersection problem
- Sweep line algorithm
- Symmetrization methods
- Velocity obstacle
- Vertex enumeration problem
- Visibility (geometry)
- Visibility polygon
- Visvalingam–Whyatt algorithm
- Watchman route problem
- Weighted Voronoi diagram
- Wiener connector
- Category:Computational topology
- Category:Computer graphics algorithms
- Category:Computer-aided design
- Category:Convex hull algorithms
- Category:Curve fitting
- Category:Digital geometry
- Category:Geographic information systems
- Category:Geometric intersection
- Category:Graph drawing
- Category:Mesh generation
- Category:Researchers in geometric algorithms
- Category:Triangulation (geometry)