combinatorial geometry

• 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.2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer,, page 425:
• 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?2006, Peter Brass, William O. J. Moser, János Pach, Research Problems in Discrete Geometry, Springer, page 183:

Theory of matroids

• 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].2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer, page 425:
• 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.2012, Don Row, Talmage James Reid, Geometry, Perspective Drawing, and Mechanisms, World Scientific, page 15: