Computational Geometry
Definition
The study and design of algorithms and data structures for solving geometric problems, focusing on efficiency, correctness, and robustness for tasks such as proximity, intersection, partitioning, and geometric optimisation in discrete and continuous settings.