TRIANGULATION FROM CROSS SECTIONS: A NEW ALGORTIlIM

@inproceedings{DellaMalvaRM1992a,
 abstract = { A method for reconstructing a three-dimensional object from serial cross-sections is presented in this paper. As conventional triangulation algorithms from planar contours suffer from sorne limitations, we propose a series of options in order to provide a solution to the problems encountered. We frrst describe a triangulation algorithm for two nonconvex contours. Three options are suggested to improve the triangulation. One of these options proceeds by mapping adjacent contours onto the same unit square, the second option uses an original decomposition of an arbitrary contour into elementary convex subcontours. Highly ambiguous situations are resolved by the third option, which one requests user interaction. Then the problem of linking one contour in a slice to several contours in an adjacent slice is exarnined.To this end, a new and unique interpolated contour is generated between the 2 slices, and the link is created using the previously defined procedure. },
 author = { Della Malva, Robert },
 booktitle = { 5th gOcad Meeting },
 month = { "june" },
 publisher = { ASGA },
 title = { TRIANGULATION FROM CROSS SECTIONS: A NEW ALGORTIlIM },
 year = { 1992 }
}