We propose an integrated data structure which represents, at the same time, an image in the cubic grid and three well-composed images, homotopy equivalent to it with face-, edge- and vertex-adjacency. After providing an algorithm to build the structure, we present examples showing how, thanks to such data structure, image processing algorithms can be written in a transparent way w.r.t. the adjacency type. Applications include rapid prototyping and teaching.
Transparent management of adjacencies in the cubic grid
Paola Magillo;
2022-01-01
Abstract
We propose an integrated data structure which represents, at the same time, an image in the cubic grid and three well-composed images, homotopy equivalent to it with face-, edge- and vertex-adjacency. After providing an algorithm to build the structure, we present examples showing how, thanks to such data structure, image processing algorithms can be written in a transparent way w.r.t. the adjacency type. Applications include rapid prototyping and teaching.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
post_print.pdf
accesso chiuso
Descrizione: Contributo in volume
Tipologia:
Documento in Post-print
Dimensione
442.11 kB
Formato
Adobe PDF
|
442.11 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
