Sökning: onr:"swepub:oai:DiVA.org:uu-480274" >
Efficient Parallel ...
Efficient Parallel Thinning of 3d Objects on the Body-centered Cubic Lattice
-
- Brunner, David (författare)
- Tech Univ Chemnitz, Dept Comp Sci, Chemnitz, Germany.
-
- Brunnett, Guido (författare)
- Tech Univ Chemnitz, Dept Comp Sci, Chemnitz, Germany.;Tech Univ Chemnitz, Dept Comp Sci, Professorship Comp Graph & Visualizat, Chemnitz, Germany.
-
- Kronfeld, Thomas (författare)
- Tech Univ Chemnitz, Dept Comp Sci, Chemnitz, Germany.;Tech Univ Chemnitz, Dept Comp Sci, Professorship Comp Graph & Visualizat, Chemnitz, Germany.
-
visa fler...
-
- Strand, Robin, 1978- (författare)
- Uppsala universitet,Bildanalys och människa-datorinteraktion,Avdelningen för visuell information och interaktion,Radiologi
-
visa färre...
-
Tech Univ Chemnitz, Dept Comp Sci, Chemnitz, Germany Tech Univ Chemnitz, Dept Comp Sci, Chemnitz, Germany.;Tech Univ Chemnitz, Dept Comp Sci, Professorship Comp Graph & Visualizat, Chemnitz, Germany. (creator_code:org_t)
- Elsevier, 2022
- 2022
- Engelska.
-
Ingår i: Computer-Aided Design. - : Elsevier. - 0010-4485 .- 1879-2685. ; 151
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We consider thinning methods to extract one dimensional skeletons from discrete objects defined on the body-centered cubic (bcc) lattice. In Strand (2004), a condition has been given that guarantees the preservation of the object's topology in such a thinning process. In this paper, we present stronger conditions that even allow the topological invariant point removal in a parallelized process. These conditions for p-simplicity can be efficiently evaluated which leads to a very fast thinning process. We show that p-simplicity is a new concept that cannot be obtained by adapting the checking plane conditions of Tsao and Fu to the bcc lattice. Furthermore, we introduce distance information and an optional pruning mechanism into the thinning process to improve the quality of the resulting skeletons. The presented results show that our method generates high quality skeletons that reproduce the symmetries of the models even under the condition of added noise and contain only very few spurious branches. The presented running times demonstrate the linear run-time behavior of our algorithm and the speedup that is achieved by the parallelization. (C) 2022 Elsevier Ltd. All rights reserved.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Body-centered cubic grid
- Parallel thinning
- Skeletonization
- Datoriserad bildbehandling
- Computerized Image Processing
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas