Bereg, S.Jiang, M.Zhu, B.Gershon Elber and Nicholas Patrikalakis and Pere Brunet2016-02-172016-02-1720043-905673-55-X1811-7783https://doi.org/10.2312/sm.20041406In this paper, we present the first nontrivial theoretical bound on the quality of the 3D solids generated by any contour interpolation method. Given two arbitrary parallel contour slices with n vertices in 3D, let a be the smallest angle in the constrained Delaunay triangulation of the corresponding 2D contour overlay, we present a contour interpolation method which reconstructs a 3D solid with the minimum dihedral angle of at least a 8 . Our algorithm runs in O(nlogn) time where n is the size of the contour overlay. We also present a heuristic algorithm that optimizes the dihedral angles of a mesh representing a surface in 3D.I.3.5 [Computer Graphics]Curvesurfacesolidand object representations10.2312/sm.20041406303-308