Abstract
This paper presents a parallel algorithm that approximates the surface of an object from a collection of its planar contours. Such a reconstruction has wide applications in such diverse fields as biological research, medical diagnosis and therapy, architecture, automobile and ship design, and solid modeling. The surface reconstruction problem is transformed into the problem of finding a minimum-cost acceptable path on a toroidal grid graph, where each horizontal and each vertical edge have the same orientation. An acceptable path is closed path that makes a complete horizontal and vertical circuit. We exploit the structure of this graph to develop efficient parallel algorithms for a message-passing computer. Givenp processors and anm byn toroidal graph, our algorithm will find the minimum cost acceptable path inO(mn log(m)/p) steps, ifp =O(mn/((m + n) log(mn/(m + n)))), which is an optimal speedup. We also show that the algorithm will sendO(p 2(m + n)) messages. The algorithm has a linear topology, so it is easy to embed the algorithm in common multiprocessor architectures.
Similar content being viewed by others
References
C.C. Chen. “A distributed algorithm for shortest paths.”IEEE Trans. Computers, C-313(9):898–899, 1982.
N. Deo, C.Y. Pang, and R.E. Lord. “Two parallel algorithms for shortest path problems.” InProceedings of the 1980 Int's Conference on Parallel Processing, pages 244–253, 1980.
D.M. Eckstein.Parallel Algorithms for Graph Theoretic Problems. Ph.D. Thesis, University of Illinois, Dept. of Mathematics, 1977.
A. Frieze and L. Rudolph. “A parallel algorithm for all pairs shortest paths in a random graph.” InProc. 22nd Allerton Conf., pages 663–670, 1984.
H. Fuchs, Z.M. Kedem, and S.P. Uselton. “Optimal surface reconstruction from planar contours.”Communications of the ACM, 20(10):693–702, 1977.
E. Keppel. “Approximating complex surfaces by triangulation of contour lines.”IBM Journal of Research and Development, 19:2–11, 1975.
L. Kucera. “Parallel computation and conflicts in memory access.”Inf. Proc. Letters, 14(2):93–96, 1982.
G.D. Lakhani. “An improved distribution algorithm for shortest paths problem.”IEEE Transactions on Computers, C-33(9):855–857, 1984.
Panos Livadas. “A reconstruction of an unknown 3-D surface from a collection of its cross sections: An implementation.”Int'l Journal of Computer Math, 26, 1989.
W.E. Lorensen and H.E. Kline. “Marching cubes: A high resolution 3d surface reconstruction algorithm.”Computer Graphics, 21(4):163–169, 1987.
J.V. Miller, D.E. Breen, W.E. Lorensen, R.M. O'Bara, and M.J. Wozny. “Geometrically deformed models: A method for extracting closed geometric models from volume data.”Computer Graphics, 25(4):217–226, 1991.
R.C. Paige and C.P. Kruskal. “Parallel algorithms for shortest path problems.” InInt'l conference on Parallel Processing, pages 14–20, 1985.
M. Quinn and Y. Yoo. “Data structures for the efficient solution of graph theoretic problems on tightly-coupled computers.” InProceedings of the International Conference on Parallel Processing, pages 431–438, 1984.
E. Reghbati and D.G. Corneil. “Parallel computations in graph theory.”SIAM J. Computing, 7(2):230–236, 1978.
J.H. Reif and J. Spirakis. “The expected time complexity of parallel graph and digraph algorithms.” Technical Report TR-11-82, Aiken Computation Lab., Harvard University, 1982.
C. Savage.Parallel Algorithms for Graph Theoretic Problems. Ph.D. Thesis, University of Illinois, Dept. of Mathematics, 1977.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johnson, T., Livadas, P.E. A parallel algorithm for surface-based object reconstruction. J Math Imaging Vis 4, 389–400 (1994). https://doi.org/10.1007/BF01262404
Issue Date:
DOI: https://doi.org/10.1007/BF01262404