Generalized map

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, a generalized map is a topological model which allows one to represent and to handle subdivided objects. This model was defined starting from combinatorial maps in order to represent non-orientable and open subdivisions, which is not possible with combinatorial maps. The main advantage of generalized map is the homogeneity of one-to-one mappings in any dimensions, which simplifies definitions and algorithms comparing to combinatorial maps. For this reason, generalized maps are sometimes used instead of combinatorial maps, even to represent orientable closed partitions.

Like combinatorial maps, generalized maps are used as efficient data structure in image representation and processing, in geometrical modeling, they are related to simplicial set and to combinatorial topology, and this is a boundary representation model (B-rep or BREP), i.e. it represents object by its boundaries.

General definition[edit]

The definition of generalized map in any dimension is given in [1] and:[2]

A nD generalized map (or nG-map) is an (n + 2)-tuple G = (Dα0, ..., αn) such that:

  • D is a finite set of darts;
  • α0, ..., αn are involutions on D;
  • αi o αj is an involution if i + 2 ≤ j (ij ∈ { 0, ,..., n }).

An nD generalized map represents the subdivision of an open or closed orientable or not nD space.

See also[edit]

References[edit]

  1. ^ Lienhardt P., Topological models for boundary representation: a comparison with n-dimensional generalized maps, Computer-Aided Design, Vol. 23, no.1, pp. 59–82, 1991
  2. ^ Lienhardt P., N-dimensional generalized combinatorial maps and cellular quasi-manifolds, International Journal on Computational Geometry and Applications, Vol. 4, n° 3, pp. 275–324, 1994