52-XX Convex and discrete geometry
52-00 General reference works (handbooks, dictionaries, bibliographies, etc.)
52-01 Instructional exposition (textbooks, tutorial papers, etc.)
52-02 Research exposition (monographs, survey articles)
52-03 Historical {!must also be assigned at least one classification number from section 01}
52-04 Explicit machine computation and programs (not the theory of computation or programming)
52-06 Proceedings, conferences, collections, etc.
52Axx General convexity
52A01 Axiomatic and generalized convexity
52A05 Convex sets without dimension restrictions
52A07 Convex sets in topological vector spaces [See also 46A55]
52A10 Convex sets in 2 dimensions (including convex curves) [See also 53A04]
52A15 Convex sets in 3 dimensions (including convex surfaces) [See also 53A05, 53C45]
52A20 Convex sets in n dimensions (including convex hypersurfaces) [See also 53A07, 53C45]
52A21 Finite-dimensional Banach spaces (including special norms, zonoids, etc.) [See also 46Bxx]
52A22 Random convex sets and integral geometry [See also 53C65, 60D05]
52A27 Approximation by convex sets
52A30 Variants of convex sets (star-shaped, (m,n)-convex, etc.)
52A35 Helly-type theorems and geometric transversal theory
52A37 Other problems of combinatorial convexity
52A38 Length, area, volume [See also 26B15, 28A75, 49Q20]
52A39 Mixed volumes and related topics
52A40 Inequalities and extremum problems
52A41 Convex functions and convex programs [See also 26B25, 90C25]
52A55 Spherical and hyperbolic convexity
52A99 None of the above, but in this section
52Bxx Polytopes and polyhedra
52B05 Combinatorial properties (number of faces, shortest paths, etc.) [See also 05Cxx]
52B10 Three-dimensional polytopes
52B11 n-dimensional polytopes
52B12 Special polytopes (linear programming, centrally symmetric, etc.)
52B15 Symmetry properties of polytopes
52B20 Lattice polytopes (including relations with commutative algebra and algebraic geometry) [See also 06A11, 13F20, 13Hxx]
52B22 Shellability
52B35 Gale and other diagrams
52B40 Matroids (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) [See also 05B35, 52Cxx]
52B45 Dissections and valuations (Hilbert's third problem, etc.) [See also 68-XX]
52B55 Computational aspects related to convexity {For computational geometry and algorithms, see 68Q25, 68U05; for numerical algorithms, see 65Yxx} [See also 68Uxx]
52B60 Isoperimetric problems for polytopes
52B70 Polyhedral manifolds
52B99 None of the above, but in this section
52Cxx Discrete geometry
52C05 Lattices and convex bodies in 2 dimensions [See also 11H06, 11H31, 11P21]
52C07 Lattices and convex bodies in n dimensions [See also 11H06, 11H31, 11P21]
52C10 Erd\"os problems and related topics of discrete geometry [See also 11Hxx]
52C15 Packing and covering in 2 dimensions [See also 05B40, 11H31]
52C17 Packing and covering in n dimensions [See also 05B40, 11H31]
52C20 Tilings in 2 dimensions [See also 05B45, 51M20]
52C22 Tilings in n dimensions [See also 05B45, 51M20]
52C23 Quasicrystals, aperiodic tilings
52C25 Rigidity and flexibility of structures [See also 70B15]
52C26 Circle packings and conformal approximations
52C30 Planar arrangements of lines and pseudolines [See also 32S22]
52C35 Arrangements of points, flats, hyperplanes
52C40 Oriented matroids
52C45 Combinatorial complexity of geometric structures [See also 68U05]
52C99 None of the above, but in this section