Parallel computation of the Euler number via Connectivity Graph
From MaRDI portal
Publication:4287124
DOI10.1016/0167-8655(93)90148-7zbMath0802.68179OpenAlexW2034509043MaRDI QIDQ4287124
Franco Chiavetta, Vito Di Gesu
Publication date: 12 April 1994
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8655(93)90148-7
parallel computationEuler numberparallel algorithmcylindrical algebraic decompositionbinary imagedigital topologyconnectivity graph
Related Items (4)
Computation of the Euler number using the contact perimeter ⋮ An approach to the computation of the Euler number by means of the vertex chain code ⋮ Two-view ``cylindrical decomposition of binary images ⋮ A proof of image Euler number formula
This page was built for publication: Parallel computation of the Euler number via Connectivity Graph