Digital Topology of Sets of Convex Voxels
Abstract
Classical digital geometry deals with sets of cubical voxels (or square pixels) that can share faces, edges, or vertices; but basic parts of digital geometry can be generalized to sets S of convex voxels (or pixels) that can have arbitrary intersections. In particular, it can be shown that if each voxel P of S has only finitely many neighbors (voxels of S that intersect P), and if any nonempty intersection of neighbors of P intersects P, then the neighborhood N(P) of every voxel P is simply connected, and if the topology of N(P) does not change when P is deleted (i.e., P is a simple voxel), then deletion of P does not change the topology of S.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1998
- Accession Number
- ADA353697
Entities
People
- Ariel Rosenfeld
- Punam K. Saha
Organizations
- University of Maryland