A graph-with-loop structure for a topological representation of 3D objects

Authors:
Rocio Gonzalez-Diaz;María José Jiménez;Belen Medrano;Pedro Real
Affiliations:
Applied Math Department, University of Seville, Spain;Applied Math Department, University of Seville, Spain;Applied Math Department, University of Seville, Spain;Applied Math Department, University of Seville, Spain
Venue:
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Year:
2007

Citing 3
Cited 1

Loops in Reeb Graphs of 2-Manifolds

Discrete & Computational Geometry
On the cohomology of 3D digital images

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Extending the notion of AT-model for integer homology computation

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition

Using Membrane Computing for Obtaining Homology Groups of Binary 2D Digital Images

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a cell complex K whose geometric realization |K| is embedded in R3 and a continuous function h : |K| → R (called the height function), we construct a graph Gh(K) which is an extension of the Reeb graph Rh(|K|). More concretely, the graph Gh(K) without loops is a subdivision of Rh(|K|). The most important difference between the graphs Gh(K) and Rh(|K|) is that Gh(K) preserves not only the number of connected components but also the number of "tunnels" (the homology generators of dimension 1) of K. The latter is not true in general for Rh(|K|). Moreover, we construct a map ψ : Gh(K) → K identifying representative cycles of the tunnels in K with the ones in Gh(K) in the way that if e is a loop in Gh(K), then ψ(e) is a cycle in K such that all the points in |ψ(e)| belong to the same level set in |K|.