Category:Geometric algorithms
 | Computing portal |
Here is a list of articles in the category Geometric algorithms of the Computing portal that unifies foundations of mathematics and computations using computers. This category deals with algorithms in geometry. See also "Computational geometry".
Subcategories
This category has the following 8 subcategories, out of 8 total.
C
D
G
M
R
Pages in category "Geometric algorithms"
The following 79 pages are in this category, out of 79 total.
B
- Bentley–Ottmann algorithm (computing)
- Bitonic tour (computing)
- Boolean operations on polygons (computing)
- Bounding sphere (computing)
- Bounding volume (computing)
- Bowyer–Watson algorithm (computing)
- Bregman divergence (computing)
C
- Centroidal Voronoi tessellation (computing)
- CGAL (software)
- Closest pair of points problem (computing)
- Cone algorithm (computing)
- Criss-cross algorithm (computing)
- Curve fitting (computing)
D
- Delaunay tessellation field estimator (astronomy)
- Delaunay triangulation (computing)
E
- Euclidean shortest path (computing)
F
- Fan triangulation (computing)
- Fixed-radius near neighbors (computing)
- Fréchet distance (computing)
- Function representation (computing)
G
- Geometric design (computing)
- Geometric median (computing)
- Geometric modeling (computing)
- Geometric primitive (computing)
- Geometric spanner (computing)
- Gilbert–Johnson–Keerthi distance algorithm (computing)
- Gradient pattern analysis (computing)
- Greedy geometric spanner (computing)
H
- Hierarchical RBF (computing)
- HyperFun (software)
J
- JTS Topology Suite (software)
K
- Katchalski-Katzir algorithm (chemistry)
L
- Largest empty rectangle (computing)
- Largest empty sphere (computing)
- Line fitting (computing)
- Line segment intersection (computing)
- Line–line intersection (computing)
- Line–plane intersection (computing)
- Line–sphere intersection (computing)
- Linear programming (computing)
- List of numerical computational geometry topics (computing)
- Lloyd's algorithm (computing)
- Local feature size (computing)
M
- Marching triangles (computing)
- Mesh generation (computing)
- Midpoint circle algorithm (computing)
- Minimum bounding box (computing)
- Minimum bounding box algorithms (computing)
- Minimum bounding rectangle (computing)
- Minkowski addition (computing)
- Minkowski Portal Refinement (computing)
- Möller–Trumbore intersection algorithm (computing)
- Monotone polygon (computing)
N
- Nearest neighbor search (computing)
- Nesting algorithm (computing)
P
- Planar straight-line graph (computing)
- List of programs for point cloud processing (physics)
- Point in polygon (computing)
- Proximity problems (computing)
- Prune and search (computing)
R
- Ramer–Douglas–Peucker algorithm (computing)
- Rectilinear Steiner tree (computing)
- Rotating calipers (computing)
S
- Shoelace formula (computing)
- Space partitioning (computing)
- Spatial database (computing)
- Star-shaped polygon (computing)
- Steiner tree problem (computing)
- Stencil jumping (computing)
- Surface-to-surface intersection problem (computing)
- Sweep line algorithm (computing)
- Symmetrization methods (computing)
V
- Velocity obstacle (computing)
- Vertex enumeration problem (computing)
- Visibility (geometry) (computing)
- Visibility polygon (computing)
W
- Watchman route problem (computing)
- Weighted Voronoi diagram (computing)
- Wiener connector (computing)
Mathematics
Organizations
Books
About