Shape reconstruction from planar cross sections

摘要: We propose a new solution to the problem of constructing shape over set cross-sectional contours. construct volume whose boundary is polyhedron with triangular faces intersecting cutting planes along given This obtained, slice by slice, pruning Delaunay triangulations formed between two adjacent cross sections. The triangulation can be computed efficiently in this specific situation: an algorithm presented that optimal respect input size and output only uses 2-dimensional operations. reconstruction method extracts, from triangulation, maximum solid no singularity. It handle case where number contours varies one section other thus, contour-defined objects which are branched have holes. has been fully implemented tested on various examples; results medical images presented.