Combinatorial geometry, also known as discrete geometry, involves the study of geometric shapes and structures under the constraints of discrete sets of objects. Some synonyms for combinatorial geometry include discrete geometry, combinatorial topology, and computational geometry. Discrete geometry focuses on the study of geometric figures and structures, while combinatorial topology investigates the properties of geometric objects that remain constant even when they are distorted, stretched, or otherwise manipulated. Computational geometry, on the other hand, concerns itself with the efficient algorithmic implementation of geometry-related problems and applications. These fields all share the same fundamental goal of understanding the geometric structures that underpin our world.