List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.
See List of numerical computational geometry topics for another flavor of computational geometry that deals with geometric objects as continuous entities and applies methods and algorithms of nature characteristic to numerical analysis.
Construction/representation
- Convex hull
- Delaunay triangulation
- Line segment intersection
- Minimal convex decomposition
- Polygon triangulation
- Voronoi diagram
- Smallest bounding sphere (smallest bounding circle)
- Smallest bounding polygon
- shape dissection problems
- tessellation problems
- shape assembly problems
- shape matching problems
Interaction
Distances
Visibility
- The museum problem
- The Computer chess problem
Other
- Ray casting (also known as ray tracing)