geometry | Geometry | Euclidean geometry | Computational fluid dynamics | algebraic geometry | non-Euclidean geometry | Cylinder (geometry) | cylinder (geometry) | computational fluid dynamics | Computational complexity theory | computational chemistry | Taxicab geometry | prism (geometry) | parallel (geometry) | Noncommutative geometry | IEEE Computational Intelligence Society | Geometry Wars: Galaxies | Diophantine geometry | Computational Science Graduate Fellowship | Computational Mechanics | Computational mechanics | Computational intelligence | Computational Fluid Dynamics | computational complexity theory | Whitehead's point-free geometry | Wedge (geometry) | Variable Geometry | Variable geometry | Triangulation (geometry) | Translation (geometry) |
The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find the shortest path between the points that does not intersect any of the obstacles.
CGAL, the Computational Geometry Algorithms Library (CGAL) is a software library that aims to provide easy access to efficient and reliable algorithms in computational geometry.
David Avis - discrete optimization and computational geometry
Richter-Gebert, J. and G. Ziegler, Oriented Matroids, In Handbook of Discrete and Computational Geometry, J. Goodman and J.O'Rourke, (eds.), CRC Press, Boca Raton, 1997, p.