computational geometry

English Wikipedia has an article on:

computational geometry

Wikipedia

computational geometry (uncountable)

1. (computer science, geometry) A field of study, within computer science, devoted to algorithms that solve problems formulated in geometric terms.
   • 1991, Herbert Edelsbrunner, Lines in Space—A Collection of Results, Jacob E. Goodman, Richard D. Pollack, William L. Steiger (editors), Discrete and Computational Geometry: Papers from the DIMACS Special Year, American Mathematical Society, Association for Computing Machinery, page 77,

     In computational geometry it is a truism that problems in three-dimensional space, ${\displaystyle \mathbb {R} ^{3}}$, are significantly more difficult and complex than the corresponding problems in the two-dimensional plane, ${\displaystyle \mathbb {R} ^{2}}$.

   • 2003, Ren-Hong Wang, Multivariate Spline and Geometry, Ren-Hong Wang (editor), Computational Geometry, American Mathematical Society, International Press, page 195,

     In this survey, we will be concerned with the relationship between multivariate splines and geometries including computational geometry, differential geometry, and algebraic geometry.

   • 2012, J. Andreas Bærentzen, Jens Gravesen, François Anton, Henrik Aanæs, Guide to Computational Geometry Processing, Springer, page 1:

     Computational geometry processing is about practical algorithms that operate on geometric data sets, and these data sets tend to be rather large if they are to be useful.