Given a grid-sampled 1-Lipschitz function (such as a signed distance function) sampled on a regular grid, we determine the sharp infimum such that for every the true zero-level set is contained in the marching cubes mesh for . For grids with spacing , the sharp infimum is . This result is proven \emph{despite} the planar marching cube faces potentially lying on either side of the level set of the trilinearly interpolated approximation of (which shares the same infimum). The proof instead constructs a convex lift of the corner samples and shows that the high-side portion of each marching-cubes cell lies in the projection of its -superlevel portion, which cannot contain a point of .

生成讲解博客的中文版本

生成AI智能校验的中文版本