Computing cup products in Z₂-cohomology of 3D polyhedral complexes

Abstract: Let

I = (m a t h b b Z^{3}, 26, 6, B)

be a 3D digital image, let

Q (I)

be the associated cubical complex and let

p a r t i a l 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

m a t h b b Z^{3} s m a l l s e t m i n u s B

in the background -- the ambient space. We show how to simplify the combinatorial structure of

p a r t i a l Q (I)

and obtain a 3D polyhedral complex

P (I)

homeomorphic to

p a r t i a l Q (I)

but with fewer cells. We introduce an algorithm that computes cup products on

H^{*} (P (I); m a t h b b Z_{2})

directly from the combinatorics. The computational method introduced here can be effectively applied to any polyhedral complex embedded in

m a t h b b R^{3}

.

Recommendations

Cites Work

Cited In (11)

Uses Software

This page was built for publication: Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes