A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Topological numbering of features on a mesh
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
doi:10.1007/bf01759070
fatcat:7nxckewanfdgbgtxegqmkyej7e