Cups Products in Z2-Cohomology of 3D Polyhedral Complexes

07/10/2012
by   Rocio Gonalez-Diaz, et al.
0

Let I=(Z^3,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 Z^3∖ 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);Z_2) directly from the combinatorics. The computational method introduced here can be effectively applied to any polyhedral complex embedded in R^3.

READ FULL TEXT

page 14

page 15

page 16

page 17

page 19

page 20

research
09/16/2021

0-Gaps on 3D Digital Curves

In Digital Geometry, gaps are some basic portion of a digital object tha...
research
09/05/2018

Repetition avoidance in products of factors

We consider a variation on a classical avoidance problem from combinator...
research
03/19/2021

Tri-Partitions and Bases of an Ordered Complex

Generalizing the decomposition of a connected planar graph into a tree a...
research
08/18/2022

GraVoS: Gradient based Voxel Selection for 3D Detection

3D object detection within large 3D scenes is challenging not only due t...
research
09/25/2018

Towards Automated Let's Play Commentary

We introduce the problem of generating Let's Play-style commentary of ga...
research
11/11/2020

An Instance-Based Algorithm for Deciding the Bias of a Coin

Let q ∈ (0,1) and δ∈ (0,1) be real numbers, and let C be a coin that com...

Please sign up or login with your details

Forgot password? Click here to reset