Computer Science – Discrete Mathematics
Scientific paper
2009-06-15
Proc. Int. Work. Combinatorial Image Analysis (IWCIA2003), Palermo : Italie (2003)
Computer Science
Discrete Mathematics
Scientific paper
10.1016/S1571-0653(04)00497-4
This paper proposes a concise coding of the cells of n-dimensional finite regular grids. It induces a simple, generic and efficient framework for implementing classical digital topology data structures and algorithms. Discrete subsets of multidimensional images (e.g. regions, digital surfaces, cubical cell complexes) have then a common and compact representation. Moreover, algorithms have a straightforward and efficient implementation, which is independent from the dimension or sizes of digital images. We illustrate that point with generic hypersurface boundary extraction algorithms by scanning or tracking. This framework has been implemented and basic operations as well as the presented applications have been benchmarked.
No associations
LandOfFree
Coding cells of digital spaces: a framework to write generic digital topology algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coding cells of digital spaces: a framework to write generic digital topology algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding cells of digital spaces: a framework to write generic digital topology algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-316811