{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:26:35Z","timestamp":1648639595519},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01262404","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T20:14:31Z","timestamp":1111608871000},"page":"389-400","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for surface-based object reconstruction"],"prefix":"10.1007","volume":"4","author":[{"given":"Theodore","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos E.","family":"Livadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"CR1","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TC.1982.1676107","volume":"C-313","author":"C.C. Chen","year":"1982","unstructured":"C.C. Chen. ?A distributed algorithm for shortest paths.?IEEE Trans. Computers, C-313(9):898?899, 1982.","journal-title":"IEEE Trans. Computers"},{"key":"CR2","unstructured":"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."},{"key":"CR3","unstructured":"D.M. Eckstein.Parallel Algorithms for Graph Theoretic Problems. Ph.D. Thesis, University of Illinois, Dept. of Mathematics, 1977."},{"key":"CR4","unstructured":"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."},{"issue":"10","key":"CR5","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/359842.359846","volume":"20","author":"H. Fuchs","year":"1977","unstructured":"H. Fuchs, Z.M. Kedem, and S.P. Uselton. ?Optimal surface reconstruction from planar contours.?Communications of the ACM, 20(10):693?702, 1977.","journal-title":"Communications of the ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1147\/rd.191.0002","volume":"19","author":"E. Keppel","year":"1975","unstructured":"E. Keppel. ?Approximating complex surfaces by triangulation of contour lines.?IBM Journal of Research and Development, 19:2?11, 1975.","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Kucera","year":"1982","unstructured":"L. Kucera. ?Parallel computation and conflicts in memory access.?Inf. Proc. Letters, 14(2):93?96, 1982.","journal-title":"Inf. Proc. Letters"},{"issue":"9","key":"CR8","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/TC.1984.1676503","volume":"C-33","author":"G.D. Lakhani","year":"1984","unstructured":"G.D. Lakhani. ?An improved distribution algorithm for shortest paths problem.?IEEE Transactions on Computers, C-33(9):855?857, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1080\/00207168908803691"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/37402.37422","volume":"21","author":"W.E. Lorensen","year":"1987","unstructured":"W.E. Lorensen and H.E. Kline. ?Marching cubes: A high resolution 3d surface reconstruction algorithm.?Computer Graphics, 21(4):163?169, 1987.","journal-title":"Computer Graphics"},{"issue":"4","key":"CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/127719.122742","volume":"25","author":"J.V. Miller","year":"1991","unstructured":"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.","journal-title":"Computer Graphics"},{"key":"CR12","unstructured":"R.C. Paige and C.P. Kruskal. ?Parallel algorithms for shortest path problems.? InInt'l conference on Parallel Processing, pages 14?20, 1985."},{"key":"CR13","unstructured":"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."},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","volume":"7","author":"E. Reghbati","year":"1978","unstructured":"E. Reghbati and D.G. Corneil. ?Parallel computations in graph theory.?SIAM J. Computing, 7(2):230?236, 1978.","journal-title":"SIAM J. Computing"},{"key":"CR15","unstructured":"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."},{"key":"CR16","unstructured":"C. Savage.Parallel Algorithms for Graph Theoretic Problems. Ph.D. Thesis, University of Illinois, Dept. of Mathematics, 1977."}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01262404.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01262404\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01262404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:09:45Z","timestamp":1556780985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01262404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01262404"],"URL":"https:\/\/doi.org\/10.1007\/bf01262404","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}