2009Pattern Recognition and Image AnalysisRequires access

Simplicialization of digital volumes in 26-adjacency: Application to topological analysis

Jean‐Luc Mari, Pedro Real

Open publisher page 7 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Adjacency list, Persistent homology, Topological data analysis, Topology (electrical circuits), Mathematics, Simplicial complex, Simple (philosophy), Algebraic topology

Related papers

Back to paper searchBrowse research topicsOriginal source
Simplicialization of digital volumes in 26-adjacency: Application to topological analysis — Research Paper | ScholarLens