Parallel computation of the Euler number via Connectivity Graph

DOI10.1016/0167-8655(93)90148-7MaRDI QIDQ4287124zbMATH OpenOpenAlexFDO

Authors Franco Chiavetta, Vito Di Gesù

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

zbMATH Keywords

binary imageconnectivity graphcylindrical algebraic decompositiondigital topologyEuler numberparallel algorithmparallel computation

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 5139590
• A proof of image Euler number formula
• Generating cubical complexes from image data and computation of the Euler number
• An algorithm for connected-component labeling, hole labeling and Euler number computing
• Winding and Euler numbers for 2D and 3D digital images

Cited in

(7)

• An approach to the computation of the Euler number by means of the vertex chain code
• A proof of image Euler number formula
• A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing
• scientific article; zbMATH DE number 1880949 (Why is no real title available?)
• A parallel approach to the Eulerian cycle problem
• Two-view ``cylindrical decomposition of binary images
• Computation of the Euler number using the contact perimeter

This page was built for publication: Parallel computation of the Euler number via Connectivity Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287124)