Contraction kernels and combinatorial maps

摘要: Graph pyramids are made of a stack successively reduced graphs embedded in the plane. Such overcome main limitations their regular ancestors. The used pyramid may be region adjacency graphs, dual or combinatorial maps. Compared to usual graph data structures, maps offer an explicit encoding orientation edges around vertices. Each map is generated from one below by set contracted. This contraction process controlled kernels that can combined many ways. paper shows producing slow reduction rate speed up reduction. Conversely, decompose into smaller generate more gradual We also propose sequential and parallel algorithm compute contracted