The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Optimal surface reconstruction from planar contours
Open accessAbstract
In many scientific and technical endeavors, a three-dimensional solid must be reconstructed from serial sections, either to aid in the comprehension of the object's structure or to facilitate its automatic manipulation and analysis. This paper presents a general solution to the problem of constructing a surface over a set of cross-sectional contours. This surface, to be composed of triangular tiles, is constructed by separately determining an optimal surface between each pair of consecutive contours. Determining such a surface is reduced to the problem of finding certain minimum cost cycles in a directed toroidal graph. A new fast algorithm for finding such cycles is utilized. Also developed is a closed-form expression, in terms of the number of contour points, for an upper bound on the number of operations required to execute the algorithm. An illustrated example which involves the construction of a minimum area surface describing a human head is included.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harary, F. (1969) · Cited by 10,739
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Graph Theory: An Algorithmic Approach
Kay, E. (1976) · Journal of the Operational Research Society · doi:10.1057/jors.1976.202 · Cited by 902
Three Dimensional Reconstruction from Serial Sections
LEVINTHAL, C., & WARE, R. (1972) · Nature · doi:10.1038/236207a0 · Cited by 162
Cited by
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37422 · Cited by 8,647
Drebin, R. A., Carpenter, L., & Hanrahan, P. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378484 · Cited by 1,612
Representations for Rigid Solids: Theory, Methods, and Systems
Requicha, A. G. (1980) · ACM Computing Surveys · doi:10.1145/356827.356833 · Cited by 1,436
Efficient ray tracing of volume data
Levoy, M. (1990) · ACM Transactions on Graphics · doi:10.1145/78964.78965 · Cited by 991
Computer rendering of stochastic models
Fournier, A., Fussell, D., & Carpenter, L. (1982) · Communications of the ACM · doi:10.1145/358523.358553 · Cited by 826
Multiresolution analysis for surfaces of arbitrary topological type
Lounsbery, M., DeRose, T. D., & Warren, J. (1997) · ACM Transactions on Graphics · doi:10.1145/237748.237750 · Cited by 760
Simulating Humans: Computer Graphics, Animation, and Control
Badler, N. I., Phillips, C. B., & Webber, B. L. (1993) · Oxford University Press eBooks · doi:10.1093/oso/9780195073591.001.0001 · Cited by 751
Marching cubes: a high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1998) · Seminal graphics · doi:10.1145/280811.281026 · Cited by 673
Bruderlin, A., & Williams, L. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218421 · Cited by 666
Texturing and modeling: a procedural approach
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5129 · Cited by 659
Geometric structures for three-dimensional shape representation
Boissonnat, J.-D. (1984) · ACM Transactions on Graphics · doi:10.1145/357346.357349 · Cited by 581
Three-dimensional Volume Rendering of Spiral CT Data: Theory and Method
Calhoun, P. S., Kuszyk, B. S., Heath, D. G., Carley, J. C., & Fishman, E. K. (1999) · RadioGraphics · doi:10.1148/radiographics.19.3.g99ma14745 · Cited by 550
Shape-based interpolation of multidimensional objects
Raya, S. P., & Udupa, J. K. (1990) · IEEE Transactions on Medical Imaging · doi:10.1109/42.52980 · Cited by 435
Three-dimensional display of human organs from computed tomograms
Herman, G. T., & Liu, H. K. (1979) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(79)90079-0 · Cited by 430
Shape transformation using variational implicit functions
Turk, G., & O'Brien, J. F. (2005) · ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05 · doi:10.1145/1198555.1198639 · Cited by 424
Two‐dimensional maps of the cerebral cortex
van Essen, D. C., & Maunsell, J. H. R. (1980) · Journal of Comparative Neurology · doi:10.1002/cne.901910208 · Cited by 365
Recent development on computer aided tissue engineering — a review
Sun, W., & Lal, P. (2002) · Computer Methods and Programs in Biomedicine · doi:10.1016/s0169-2607(01)00116-x · Cited by 360
Brebin, R. A., Carpenter, L., & Hanrahan, P. (1998) · Seminal graphics · doi:10.1145/280811.281028 · Cited by 354
Surface coding based on Morse theory
Shinagawa, Y., Kunii, T. L., & Kergosien, Y. L. (1991) · IEEE Computer Graphics and Applications · doi:10.1109/38.90568 · Cited by 334
Conversion of complex contour line definitions into polygonal element mosaics
Christiansen, H. N., & Sederberg, T. W. (1978) · Proceedings of the 5th annual conference on Computer graphics and interactive techniques · doi:10.1145/800248.807388 · Cited by 317
SCHROEDER, W. J., & MARTIN, K. M. (2005) · Visualization Handbook · doi:10.1016/b978-012387582-2/50003-4 · Cited by 285
Midbrain dopaminergic neurons (nuclei A8, A9, and A10): Three‐dimensional reconstruction in the rat
German, D. C., & Manaye, K. F. (1993) · Journal of Comparative Neurology · doi:10.1002/cne.903310302 · Cited by 255
Topology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Metadata
- Authors
- Fuchs, H., Kedem, Z. M., & Uselton, S. P.
- Venue
- Communications of the ACM
- Published
- 1977-10
- Volume
- 20
- Issue
- 10
- Pages
- 693-702
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2036345186
- Cited by
- 798
- References
- 6
- FWCI
- 17.78
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.