| Naslov: | An algorithm for voxelised solids representation using chain codes |
|---|
| Avtorji: | ID Repnik, Blaž (Avtor)
ID Váša, Libor (Avtor)
ID Žalik, Borut (Avtor) |
|---|
| Datoteke: |  1-s2.0-S0923596525000864-main.pdf (11,28 MB)
MD5: 7362F5D44DFAAE48560FC563D8EEA599
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Članek v reviji |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
|
|---|
| Opis: | The paper introduces a new method to describe the surfaces of voxelised solids. It operates in three stages: a hierarchical linked list of chain code sequences is created first; the linked lists are pruned; and, finally, the content of the data structure is stored. The method uses chain codes from either a three- or nine-symbols alphabet. In the first case, two chain code symbols are needed to access the next face, while, in the second case, this is done by one symbol. The pair of chain codes from the three-symbols alphabet, or the individual symbol from the nine-symbols alphabet are considered as tokens. The sets of tokens are, in both cases, extended by two tokens, indicating the beginning and ending of the list. The method processes solids of any shape, including those containing holes, cavities, or multiple components existing in the same voxel space. Edge-connectivity is permitted. The method was compared against the method proposed by Lemus et al., which is designed for solids without holes. Although supporting a broader set of voxelised solids, the proposed method generates sequences of tokens that are, on average, up to 10% shorter. Since the information entropy of the sequences of tokens produced by the proposed method is also smaller, the obtained sequences are more compressible, as confirmed by applying gzip and bzip2 data compressors. |
|---|
| Ključne besede: | voxels, chain code, data structures, pruning, information entropy, data compression |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 10.02.2025 |
|---|
| Datum sprejetja članka: | 19.04.2025 |
|---|
| Datum objave: | 15.05.2025 |
|---|
| Založnik: | Elsevier B.V. |
|---|
| Leto izida: | 2025 |
|---|
| Št. strani: | 29 str. |
|---|
| Številčenje: | [article no.] 117340 |
|---|
| PID: | 20.500.12556/DKUM-92858  |
|---|
| UDK: | 004.6 |
|---|
| COBISS.SI-ID: | 236316163 |
|---|
| DOI: | 10.1016/j.image.2025.117340 |
|---|
| ISSN pri članku: | 1879-2677 |
|---|
| Avtorske pravice: | ©2025 Published by Elsevier B.V. |
|---|
| Datum objave v DKUM: | 19.05.2025 |
|---|
| Število ogledov: | 186 |
|---|
| Število prenosov: | 6 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
