Combinatorial map

A combinatorial map is a combinatorial representation of a graph on an orientable surface. A combinatorial map may also be called a combinatorial embedding, a rotation system, an orientable ribbon graph, a fat graph, or a cyclic graph.[1] More generally, an -dimensional combinatorial map is a combinatorial representation of a graph on an -dimensional orientable manifold.

Combinatorial maps are used as efficient data structures in image representation and processing, in geometrical modeling. This model is related to simplicial complexes and to combinatorial topology. A combinatorial map is a boundary representation model; it represents object by its boundaries.

History

The concept of a combinatorial map was introduced informally by J. Edmonds for polyhedral surfaces[2] which are planar graphs. It was given its first definite formal expression under the name "Constellations" by A. Jacques[3][4] but the concept was already extensively used under the name "rotation" by Gerhard Ringel[5] and J.W.T. Youngs in their famous solution of the Heawood map-coloring problem. The term "constellation" was not retained and instead "combinatorial map" was favored.[6]

Combinatorial maps were later generalized to represent higher-dimensional orientable subdivided objects.

Motivation

Several applications require a data structure to represent the subdivision of an object. For example, a 2D object can be decomposed into vertices (0-cells), edges (1-cells), and faces (2-cells). More generally, an n-dimensional object is composed with cells of dimension 0 to n. Moreover, it is also often necessary to represent neighboring relations between these cells.

Thus, we want to describe all the cells of the subdivision, plus all the incidence and adjacency relations between these cells. When all the represented cells are simplexes, a simplicial complex may be used, but when we want to represent any type of cells, we need to use cellular topological models like combinatorial maps or generalized maps.

Definition

A combinatorial map is a triplet M = (D, σ, α) such that:

Intuitively, a combinatorial map corresponds to a graph where each edge is subdivided into two darts (sometimes also called half-edges). The permutation σ gives, for each dart, the next dart by turning around the vertex in the positive orientation; the other permutation α gives, for each dart, the other dart of the same edge.

α allows one to retrieve edges (alpha for arête in French), and σ allows one to retrieve vertices (sigma for sommet in French). We define φ = σ ∘ α which gives, for each dart, the next dart of the same face (phi for face also in French).

So, there are two ways to represent a combinatorial map depending if the permutation is σ or φ (see example below). These two representations are dual to each other: vertices and faces are exchanged.

Combinatorial maps example: a plane graph and the two combinatorial maps depending if we use the notation (D, σ, α) or (D, φ, α).
A plane graph
Corresponding combinatorial map (D, σ, α). Darts are represented by numbered segments, σ by gray arrows (example σ(1) = 7), two darts linked by α are drawn consecutively and separated by a small bar (example α(1) = 2).
Corresponding combinatorial map (D, φ, α). Darts are represented by numbered arrows, two darts linked by φ are drawn consecutively (example φ(1) = 3) and two darts linked by α are drawn parallel and in reverse orientation (example α(1) = 2).

Higher-dimensional generalization

An n-dimensional combinatorial map (or n-map) is a (n + 1)-tuple M = (D, β1, ..., βn) such that:[7][8]

  • D is a finite set of darts;
  • β1 is a permutation on D;
  • β2, ..., βn are involutions on D;
  • βi ∘ βj is an involution if i + 2 ≤ j (i, j ∈ { 1, ,..., n }).

An n-dimensional combinatorial map represents the subdivision of a closed orientable n-dimensional space. The constraint on βi ∘ βj guarantees the topological validity of the map as a quasi-manifold subdivision. Two-dimensional combinatorial maps can be retrieved by fixing n = 2 and renaming σ by β1 and α by β2.

Spaces that are not necessarily closed or orientable may be represented using (n-dimensional) generalized maps.

See also

References
  1. Bollobás, Béla; Riordan, Oliver (2001). "A Polynomial Invariant of Graphs On Orientable Surfaces". Proceedings of the London Mathematical Society. Wiley. 83 (3): 513–531. doi:10.1112/plms/83.3.513. ISSN 0024-6115. S2CID 15895860.
  2. Edmonds, J. (1960). "A Combinatorial Representation for Polyhedral Surfaces". Notices Amer. Math. Soc. 7. hdl:1903/24820.
  3. Jacques, A. (1969). Constellations et propriétés algébriques des graphes topologiques (PhD). University of Paris.
  4. Jacques, A. (1970). "Constellations et Graphes Topologiques". Colloque Math. Soc. János Bolyai: 657–672.
  5. Ringel, G. (2012) [1974]. Map Color Theorem. Springer. ISBN 978-3-642-65759-7.
  6. Cori, R. (1975). "Un code pour les graphes planaires et ses applications". Astérisque. 27. MR 0404045. Zbl 0313.05115.
  7. Lienhardt, P. (1991). "Topological models for Boundary Representation : a comparison with n-dimensional generalized maps". Computer-Aided Design. 23 (1): 59–82. doi:10.1016/0010-4485(91)90082-8.
  8. Lienhardt, P. (1994). "N-dimensional generalized combinatorial maps and cellular quasi-manifolds". International Journal of Computational Geometry and Applications. 4 (3): 275–324. doi:10.1142/S0218195994000173.
  • Combinatorial maps in CGAL, the Computational Geometry Algorithms Library:
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.