Category:Computational geometry
![]() | Computing portal |
Here is a list of articles in the Computational geometry category of the Computing portal that unifies foundations of mathematics and computations using computers.
Related categories
Subcategories
This category has the following 4 subcategories, out of 4 total.
C
G
T
Pages in category "Computational geometry"
The following 69 pages are in this category, out of 69 total.
- Computational geometry (computing)
3
- 3SUM (computing)
A
- Algorithmic Geometry (computing)
- Alpha shape (computing)
- Arrangement (space partition) (computing)
- Art gallery problem (computing)
- Art Gallery Theorems and Algorithms (computing)
B
- Barrier resilience (computing)
- Bentley–Ottmann algorithm (computing)
- Beta skeleton (computing)
- List of books in computational geometry (computing)
C
- CC system (computing)
- Collision detection (computing)
- Numerical algebraic geometry (computing)
- Conformal geometric algebra (computing)
- Convex hull (computing)
- Convex layers (computing)
- Convex volume approximation (computing)
- Coreset (computing)
D
- Discrete & Computational Geometry (computing)
E
- Ε-net (computational geometry) (computing)
- Euclidean shortest path (computing)
F
- Farthest-first traversal (computing)
- Fat object (computing)
- Fortune's algorithm (computing)
G
- Geometric Folding Algorithms (computing)
- Geometric separator (computing)
- Geometry processing (computing)
I
- International Journal of Computational Geometry and Applications (computing)
- Intersection (Euclidean geometry) (computing)
J
- Journal of Computational Geometry (computing)
K
- Kinetic smallest enclosing disk (computing)
- Klee's measure problem (computing)
L
- Link distance (computing)
- List of combinatorial computational geometry topics (computing)
- LP-type problem (computing)
M
- Maxima of a point set (computing)
- Maximum disjoint set (computing)
O
- Opaque forest problem (computing)
P
- Paden–Kahan subproblems (computing)
- Polygon covering (computing)
- Polygon partition (computing)
- Polyhedral terrain (computing)
- Polymake (software)
- Potato peeling (computing)
- Power diagram (computing)
- Privacy-preserving computational geometry (computing)
R
- Real RAM (computing)
- Rectilinear minimum spanning tree (computing)
- Robust geometric computation (computing)
S
- Semi-Yao graph (computing)
- Simplicial depth (computing)
- Simultaneous localization and mapping (computing)
- Smallest-circle problem (computing)
- Star unfolding (computing)
- Steiner point (computational geometry) (computing)
- Straight skeleton (computing)
- Sum of radicals (computing)
- Symposium on Computational Geometry (computing)
T
- Theil–Sen estimator (computing)
- Theta graph (computing)
- Tukey depth (computing)
U
- Urquhart graph (computing)
V
- Vertex enumeration problem (computing)
- Visibility graph (computing)
- Voronoi diagram (computing)
- Voronoi pole (computing)
W
- Well-separated pair decomposition (computing)
Y
- Yao graph (computing)