Topological numbering of features on a mesh

Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. TeWinkel
1991 Algorithmica  
Assume we are given a nxn binary image containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. In this paper we consider the problem of assigning topological numbers to such features: i.e., assign a number to every featuref so that all features to the left offub the image have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. We present a parallel algorithm to solve the topological
more » ... umbering problem in Ofn) time on an nxn mesh of processors. The key idea of our solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniqiely represent the "to the left of" relationship of the features. t
doi:10.1007/bf01759070 fatcat:7nxckewanfdgbgtxegqmkyej7e