Simplicialization of digital volumes in 26-adjacency: Application to topological analysis
Jean‐Luc Mari, Pedro Real · Pattern Recognition and Image Analysis · 2009
In this paper, we introduce a simple and original algorithm to compute a three-dimensional simplicial complex topologically equivalent to a 3D digital object V , according to the 26-adjacency. The use of this adjacency generates issues like auto-intersecting triangles that unnecessarily increase the dimensionality of the associated simplicial complex. To avoid these problems, we present an approach based on a modified Delaunay tetrahedralization of the digital object, that preserves its topological characteristics. Considering the resulting complex as an input in algebraic-topological format (fixing a ground ring for the coefficients), we develop propositions regardless of the adjacency considered. These potential applications are related to topological analysis like thinning, homology computation, topological characterization and control. Moreover, our technique is susceptible to be extended to higher dimensions.