### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 693-702 |

Number of pages | 10 |

Journal | Communications of the ACM |

Volume | 20 |

Issue number | 10 |

DOIs | |

State | Published - Oct 1 1977 |

### Keywords

- continuous tone displays
- contour data
- minimum cost paths
- serial sections
- surface reconstruction
- three-dimensional computer graphics

### ASJC Scopus subject areas

- Computer Science(all)

## Fingerprint Dive into the research topics of 'Optimal surface reconstruction from planar contours'. Together they form a unique fingerprint.

## Cite this

*Communications of the ACM*,

*20*(10), 693-702. https://doi.org/10.1145/359842.359846