Topological numbering of features on a mesh

DOI10.1007/BF01759070zbMATH Open0736.68082OpenAlexW2088530041MaRDI QIDQ1175652FDOQ1175652

Authors: Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. TeWinkel 

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01759070

Recommendations

• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• scientific article; zbMATH DE number 4050999
• A fast parallel algorithm for convex hull problem of multi-leveled images
• Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
• scientific article; zbMATH DE number 5139590

zbMATH Keywords

topological sortingmesh-connected processor arraytree computationstereo matching problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies for image processing (68U10)

Cites Work

• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Solving tree problems on a mesh-connected processor array
• Title not available (Why is that?)
• VLSI Algorithms for the Connected Component Problem

Cited In (2)

• ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
• Applications of a numbering scheme for polygonal obstacles in the plane

This page was built for publication: Topological numbering of features on a mesh

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