Let I=(Z3,26,6,B) be a 3D digital image, let Q(I) be the associated cubical complex and let ∂Q(I) be the subcomplex of Q(I) whose maximal cells are the quadrangles of Q(I) shared by a voxel of B in the foreground -- the object under study -- and by a voxel of Z3∖B in the background -- the ambient space. We show how to simplify the combinatorial structure of ∂Q(I) and obtain a 3D polyhedral complex P(I) homeomorphic to ∂Q(I) but with fewer cells. We introduce an algorithm that computes cup products on H∗(P(I);Z2) directly from the combinatorics. The computational method introduced here can be effectively applied to any polyhedral complex embedded in R3
A simple cell complex C in Euclidean d-space Ed is a covering of Ed by finitely many convex j-dimens...
We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional s...
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a c...
Let \(I=(\mathbb {Z}^3,26,6,B)\) be a three-dimensional (3D) digital image, let \(Q(I)\) be an assoc...
Let I be a 3D digital image, and let Q(I) be the associated cubical complex. In this paper we show h...
The goal of this work is to establish a new algorithm for computing the cohomology ring of cubical c...
Cohomology groups and the cohomology ring of three-dimensional (3D) objects are topological invarian...
A binary three-dimensional (3D) image II is well-composed if the boundary surface of its continuous ...
We build upon the work developed in [4] in which we presented a method to “locally repair” the cubi...
A 3D binary image I can be naturally represented by a combinatorial-algebraic structure called cubi...
We propose a method for computing the Z 2–cohomology ring of a simplicial complex uniquely associate...
Given an 80-adjacency doxel-based digital four-dimensional hypervolume V, we construct here an assoc...
Well-composed 3D digital images, which are 3D binary digital images whose boundary surface is made u...
In previous work we proposed a combinatorial algorithm to \locally repair" the cubical complex Q(I)...
The study of torus actions led to the discovery of moment-angle complexes and their generalization, ...
A simple cell complex C in Euclidean d-space Ed is a covering of Ed by finitely many convex j-dimens...
We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional s...
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a c...
Let \(I=(\mathbb {Z}^3,26,6,B)\) be a three-dimensional (3D) digital image, let \(Q(I)\) be an assoc...
Let I be a 3D digital image, and let Q(I) be the associated cubical complex. In this paper we show h...
The goal of this work is to establish a new algorithm for computing the cohomology ring of cubical c...
Cohomology groups and the cohomology ring of three-dimensional (3D) objects are topological invarian...
A binary three-dimensional (3D) image II is well-composed if the boundary surface of its continuous ...
We build upon the work developed in [4] in which we presented a method to “locally repair” the cubi...
A 3D binary image I can be naturally represented by a combinatorial-algebraic structure called cubi...
We propose a method for computing the Z 2–cohomology ring of a simplicial complex uniquely associate...
Given an 80-adjacency doxel-based digital four-dimensional hypervolume V, we construct here an assoc...
Well-composed 3D digital images, which are 3D binary digital images whose boundary surface is made u...
In previous work we proposed a combinatorial algorithm to \locally repair" the cubical complex Q(I)...
The study of torus actions led to the discovery of moment-angle complexes and their generalization, ...
A simple cell complex C in Euclidean d-space Ed is a covering of Ed by finitely many convex j-dimens...
We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional s...
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a c...