Meaning of combinatorial geometry | Babel Free

Definitions

1. The field of mathematics which examines extremal problems of a combinatorial nature expressed geometrically.
   uncountable
2. A simple matroid.
   countable

Examples

“The generation of combinatorial types of point configurations and hyperplane arrangements point configurations and hyperplane arrangements has long been an outstanding problem of combinatorial geometry.”

“The following problem of Erdős [Er46] is possibly the best known (and simplest to explain) problem in combinatorial geometry. How often can the same distance occur among n points in the plane?”

“2012, Mohammed Mostefa Mesmmoudi, et al., Discrete Curvature Estimation Methods for Triangulated Surfaces, Ullrich Köthe, Annick Montanvert, Pierre Soille (editors), Applications of Discrete Geometry and Mathematical Morphology, Springer, LNCS 7346, page 28, In combinatorial geometry, the most common discrete representation for a surface is a triangle mesh.”

“For the generation of these combinatorial types no direct method is known, and it appears to be necessary to use combinatorial abstractions — allowable sequences of permutations, #92;lambda-functions, chirotopes, combinatorial geometries, or oriented matroids; in our work we will use oriented matroids [BLVS⁺99].”

“Our purpose in this chapter is to derive fundamental properties of combinatorial geometries, and to show how these properties strengthen our intuitive understandings of figures.[…]In this section, we give an axiom system for combinatorial geometries and then prove that each combinatorial figure is a combinatorial geometry.”

CEFR level