Computational geometry

noun

noun ·Rare ·Advanced level

Definitions

Noun
  1. 1
    A field of study, within computer science, devoted to algorithms that solve problems formulated in geometric terms. uncountable

    "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, ℝ³, are significantly more difficult and complex than the corresponding problems in the two-dimensional plane, ℝ²."

Example

More examples

"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, ℝ³, are significantly more difficult and complex than the corresponding problems in the two-dimensional plane, ℝ²."