Abstract
Let be a 3D digital image, let be the associated cubical complex and let be the subcomplex of whose maximal cells are the quadrangles of shared by a voxel of in the foreground -- the object under study -- and by a voxel of in the background -- the ambient space. We show how to simplify the combinatorial structure of and obtain a 3D polyhedral complex homeomorphic to but with fewer cells. We introduce an algorithm that computes cup products on directly from the combinatorics. The computational method introduced here can be effectively applied to any polyhedral complex embedded in .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.