Distance-based skeletonization on the BCC grid
Strand proposed a distance-based thinning algorithm for computing surface skeletons on the body-centered cubic (BCC) grid. In this paper, we present two modified versions of this algorithm that are faster than the original one, and less sensitive to the visiting order of points in the sequential thi...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2021
|
| Sorozat: | Acta cybernetica
25 No. 2 |
| Kulcsszavak: | Programozás, Algoritmus |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.290076 |
| Online Access: | http://acta.bibl.u-szeged.hu/75614 |
| Tartalmi kivonat: | Strand proposed a distance-based thinning algorithm for computing surface skeletons on the body-centered cubic (BCC) grid. In this paper, we present two modified versions of this algorithm that are faster than the original one, and less sensitive to the visiting order of points in the sequential thinning phase. In addition, a novel algorithm capable of producing curve skeletons is also reported. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 351-367 |
| ISSN: | 0324-721X |