Topological numbering of features on a mesh

DOI10.1007/BF01759070zbMath0736.68082OpenAlexW2088530041MaRDI QIDQ1175652

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

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

topological sortingmesh-connected processor arraytree computationstereo matching problem

Mathematics Subject Classification ID

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

Related Items (1)

ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS

Cites Work

• Unnamed Item
• VLSI Algorithms for the Connected Component Problem
• Solving tree problems on a mesh-connected processor array
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer

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